A type system for lock-free processes
From MaRDI portal
Publication:2497143
DOI10.1006/inco.2002.3171zbMath1093.68065OpenAlexW4213249360MaRDI QIDQ2497143
Publication date: 3 August 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b04cd76512953642ec2f95f30ea39e5ced446afb
Related Items
A generic type system for the pi-calculus, Contracts for Mobile Processes, Session types revisited, Comparing type systems for deadlock freedom, On the potential advantages of exploiting behavioural information for contract-based service discovery and composition, Combining behavioural types with security analysis, A Theory of Formal Choreographic Languages, Communicating by compatibility, Partially Typed Multiparty Sessions, Unnamed Item, Unnamed Item, Typing access control and secure information flow in sessions, Trace- and failure-based semantics for responsiveness, Types for complexity of parallel computation in pi-calculus, Composition and decomposition of multiparty sessions, Responsiveness in process calculi, Pict Correctness Revisited, Analysing input/output-capabilities of mobile processes with a generic type system, Unnamed Item, Deadlock analysis of unbounded process networks, Global types with internal delegation, Pict correctness revisited, Type-based information flow analysis for the \(\pi\)-calculus, A Coq Library for Verification of Concurrent Programs
Uses Software
Cites Work
- Strong normalisation in the \(\pi\)-calculus
- A calculus of mobile processes. II
- Logic programming in a fragment of intuitionistic linear logic
- Weak and strong fairness in CCS
- The name discipline of uniform receptiveness
- Resource bound certification
- A generic type system for the Pi-calculus
- Concurrent Programming in ML
- Behavioral equivalence in the polymorphic pi-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
