A generic type system for the Pi-calculus
From MaRDI portal
Publication:5178880
DOI10.1145/360204.360215zbMath1323.68410OpenAlexW2154581630MaRDI QIDQ5178880
Naoki Kobayashi, Atsushi Igarashi
Publication date: 17 March 2015
Published in: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360204.360215
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (16)
A pi-calculus based semantics for WS-BPEL ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Session types revisited ⋮ Typing correspondence assertions for communication protocols ⋮ Communicating by compatibility ⋮ Deadlock checking by a behavioral effect system for lock handling ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Spatial-behavioral types for concurrency and resource control in distributed systems ⋮ An algebraic theory for web service contracts ⋮ Typing Correspondence Assertions for Communication Protocols ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ Abstract interpretation of mobile systems ⋮ A type system for lock-free processes ⋮ Spatial-Behavioral Types, Distributed Services, and Resources ⋮ Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines ⋮ A general framework for types in graph rewriting
This page was built for publication: A generic type system for the Pi-calculus