Correspondence assertions for process synchronization in concurrent communications

DOI10.1017/S095679680400543XzbMath1077.68605MaRDI QIDQ4676156

Eduardo Bonelli, Andriana Compagnoni, Elsa L. Gunter

Publication date: 3 May 2005

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Dynamic role authorization in multiparty conversations ⋮ Type checking a multithreaded functional language with session types ⋮ Combining behavioural types with security analysis ⋮ Bounded polymorphism in session types ⋮ Deriving session and union types for objects ⋮ Linear logic propositions as session types ⋮ An extensible approach to session polymorphism ⋮ Asynchronous Session Types and Progress for Object Oriented Languages ⋮ Linear type theory for asynchronous session types ⋮ Boxed ambients with communication interfaces ⋮ Amalgamating sessions and methods in object-oriented languages with generics ⋮ Objects and session types ⋮ Multiparty Session Types Within a Canonical Binary Theory, and Beyond ⋮ Proof-Carrying Code in a Session-Typed Process Calculus ⋮ Subtyping for session types in the pi calculus ⋮ A Calculus of Global Interaction based on Session Types ⋮ A Chart Semantics for the Pi-Calculus ⋮ Theoretical Aspects of Communication-Centred Programming

Uses Software

• Automath
• PIPER