Deadlock and lock freedom in the linear π-calculus

DOI10.1145/2603088.2603116zbMath1392.68311OpenAlexW2085243417MaRDI QIDQ4635657

Luca Padovani

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2318/153607

zbMATH Keywords

typespolymorphismdeadlocklinear \(\pi\)-calculus

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Conflation Confers Concurrency ⋮ Session types revisited ⋮ Comparing type systems for deadlock freedom ⋮ Combining behavioural types with security analysis ⋮ Separating Sessions Smoothly ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Composition and decomposition of multiparty sessions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Deadlock analysis of unbounded process networks ⋮ Global types with internal delegation ⋮ A Gentle Introduction to Multiparty Asynchronous Session Types ⋮ Probabilistic Analysis of Binary Sessions ⋮ Multiparty Session Types Within a Canonical Binary Theory, and Beyond ⋮ Prioritise the best variation