A generic type system for the pi-calculus

DOI10.1016/S0304-3975(03)00325-6zbMath1070.68105OpenAlexW1972836343MaRDI QIDQ1884932

Naoki Kobayashi, Atsushi Igarashi

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00325-6

zbMATH Keywords

deadlock-freedomrace-freedom

Mathematics Subject Classification ID

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

Related Items (20)

On projecting processes into session types ⋮ Binary Session Types for Psi-Calculi ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Type checking a multithreaded functional language with session types ⋮ Service oriented computing from a process algebraic perspective ⋮ Comparing type systems for deadlock freedom ⋮ On the potential advantages of exploiting behavioural information for contract-based service discovery and composition ⋮ Conversation types ⋮ An algebra of behavioural types ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ Spatial and behavioral types in the pi-calculus ⋮ Unnamed Item ⋮ A new type system for JVM lock primitives ⋮ A WSDL-based type system for asynchronous WS-BPEL processes ⋮ Deadlock Detection in Linear Recursive Programs ⋮ Typed ψ-calculi ⋮ Unnamed Item ⋮ Subtyping for session types in the pi calculus ⋮ Type-based information flow analysis for the \(\pi\)-calculus

Uses Software

• MIXED
• PIPER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The type and effect discipline
• Typing correspondence assertions for communication protocols
• Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
• Calculi for interaction
• A type system for lock-free processes
• Polymorphic type, region and effect inference
• Anytime, anywhere
• Types as models
• A uniform type structure for secure information flow
• Resource usage analysis
• Behavioral equivalence in the polymorphic pi-calculus

This page was built for publication: A generic type system for the pi-calculus