A Hybrid Type System for Lock-Freedom of Mobile Processes

DOI10.1007/978-3-540-70545-1_10MaRDI QIDQ3512484zbMATH OpenOpenAlexFDO

Authors Naoki Kobayashi, Davide Sangiorgi

Publication date 15 July 2008

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70545-1_10

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A type system for lock-free processes
• Deadlock and lock freedom in the linear \(\pi\)-calculus
• A New Type System for Deadlock-Free Processes
• Types for deadlock-free higher-order programs
• scientific article; zbMATH DE number 1759631

Cited in

(10)

• Two Session Typing Systems for Higher-Order Mobile Processes
• Deadlock and lock freedom in the linear \(\pi\)-calculus
• A type system for lock-free processes
• Comparing type systems for deadlock freedom
• Spatial and behavioral types in the pi-calculus
• Typed ψ-calculi
• Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
• Light logics and higher-order processes
• Safe session-based concurrency with shared linear state
• A Theory of Formal Choreographic Languages

Describes a project that uses

Uses Software

• SLMC
• Pict
• PIPER

This page was built for publication: A Hybrid Type System for Lock-Freedom of Mobile Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512484)