A Hybrid Type System for Lock-Freedom of Mobile Processes

DOI10.1007/978-3-540-70545-1_10zbMath1155.68474OpenAlexW1775146113MaRDI QIDQ3512484

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)

Related Items (6)

Comparing type systems for deadlock freedom ⋮ A Theory of Formal Choreographic Languages ⋮ Light logics and higher-order processes ⋮ Spatial and behavioral types in the pi-calculus ⋮ Typed ψ-calculi ⋮ Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines

Uses Software

• SLMC
• Pict
• PIPER

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