Fair termination of multiparty sessions
From MaRDI portal
Publication:6561335
DOI10.1016/J.JLAMP.2024.100964MaRDI QIDQ6561335FDOQ6561335
Francesco Dagnino, Luca Ciccone, Luca Padovani
Publication date: 25 June 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Cites Work
- Multiparty asynchronous session types
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- Title not available (Why is that?)
- Fundamental properties of infinite trees
- Title not available (Why is that?)
- Subtyping for session types in the pi calculus
- Multiparty Asynchronous Session Types
- Global progress for dynamically interleaved multiparty sessions
- Fairness and hyperfairness
- A New Type System for Deadlock-Free Processes
- Propositions as sessions
- Proving Liveness Properties of Concurrent Programs
- A type system for lock-free processes
- Linear Logical Relations for Session-Based Concurrency
- A theory of contracts for strong service compliance
- Fair Subtyping for Open Session Types
- Fair subtyping for multi-party session types
- Session types revisited
- Linear logic propositions as session types
- Deadlock and lock freedom in the linear π-calculus
- Deadlock analysis of unbounded process networks
- Multiparty session types as coherence proofs
- Talking bananas: structural recursion for session types
- Subtyping Supports Safe Session Substitution
- Precise subtyping for synchronous multiparty sessions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Observational Equivalence for Multiparty Sessions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizing Inference Systems by Coaxioms
- Title not available (Why is that?)
This page was built for publication: Fair termination of multiparty sessions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561335)
