A type system for lock-free processes

DOI10.1006/inco.2002.3171zbMath1093.68065MaRDI QIDQ2497143

Naoki Kobayashi

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

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Pict Correctness Revisited, Responsiveness in process calculi, Pict correctness revisited, Analysing input/output-capabilities of mobile processes with a generic type system, A generic type system for the pi-calculus, Communicating by compatibility, Type-based information flow analysis for the \(\pi\)-calculus, Contracts for Mobile Processes

Uses Software

• Pict
• Lolli

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