Comparing type systems for deadlock freedom
From MaRDI portal
Publication:2667185
DOI10.1016/j.jlamp.2021.100717zbMath1477.68177arXiv1810.00635OpenAlexW3200633237MaRDI QIDQ2667185
Publication date: 24 November 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00635
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Preface to the special issue on the 12th workshop on programming language approaches to concurrency and communication-centric software (PLACES) 2020 ⋮ Separating Sessions Smoothly ⋮ Unnamed Item ⋮ Prioritise the best variation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logical relations and observational equivalences for session-based concurrency
- Type systems for distributed programs: components and sessions
- Fundamentals of session types
- Deadlock analysis of unbounded process networks
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of mobile processes. I
- A new linear logic for deadlock-free session-typed processes
- A generic type system for the pi-calculus
- Towards a unified approach to encodability and separation results for process calculi
- Prioritise the best variation
- Session types revisited
- A type system for lock-free processes
- Subtyping for session types in the pi calculus
- Programming languages and systems. 28th European symposium on programming, ESOP 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings
- Corecursion and Non-divergence in Session-Typed Processes
- Towards Static Deadlock Resolution in the $$\pi $$-Calculus
- Expressiveness of Process Algebras
- Talking bananas: structural recursion for session types
- Linearity, Control Effects, and Behavioral Types
- Conflation Confers Concurrency
- Deadlock Analysis of Unbounded Process Networks
- A Hybrid Type System for Lock-Freedom of Mobile Processes
- Global Progress in Dynamically Interleaved Multiparty Sessions
- Session Types as Intuitionistic Linear Propositions
- Conversation Types
- Deadlock and lock freedom in the linear π-calculus
- Propositions as sessions
- Linear logic propositions as session types
- Full abstraction for expressiveness: history, myths and facts
- General conditions for full abstraction
- A New Type System for Deadlock-Free Processes
- Formal Methods at the Crossroads. From Panacea to Foundational Support
- Separating Sessions Smoothly
This page was built for publication: Comparing type systems for deadlock freedom
