Deadlock and lock freedom in the linear -calculus

DOI10.1145/2603088.2603116MaRDI QIDQ4635657zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A New Type System for Deadlock-Free Processes
• A new linear logic for deadlock-free session-typed processes
• A type system for lock-free processes
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• Types for deadlock-free higher-order programs

Cited in

(25)

• Probabilistic Analysis of Binary Sessions
• Fair termination of multiparty sessions
• scientific article; zbMATH DE number 7566072 (Why is no real title available?)
• scientific article; zbMATH DE number 7649947 (Why is no real title available?)
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• Session-based concurrency in Maude: executable semantics and type checking
• Global types with internal delegation
• Executable Semantics and Type Checking for Session-Based Concurrency in Maude
• Session coalgebras: a coalgebraic view on session types and communication protocols
• Comparing type systems for deadlock freedom
• Deadlock analysis of unbounded process networks
• Conflation confers concurrency
• A logical account of subtyping for session types
• Combining behavioural types with security analysis
• Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
• Deadlock freedom for asynchronous and cyclic process networks
• Session types revisited
• A New Type System for Deadlock-Free Processes
• A gentle introduction to multiparty asynchronous session types
• Composition and decomposition of multiparty sessions
• Asynchronous functional sessions: cyclic and concurrent
• scientific article; zbMATH DE number 7559468 (Why is no real title available?)
• Separating Lock-Freedom from Wait-Freedom
• A universal session type for untyped asynchronous communication
• Multiparty Session Types Within a Canonical Binary Theory, and Beyond

This page was built for publication: Deadlock and lock freedom in the linear \(\pi\)-calculus

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