Fair termination of multiparty sessions
From MaRDI portal
Publication:6561335
Cites work
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- scientific article; zbMATH DE number 3972158 (Why is no real title available?)
- scientific article; zbMATH DE number 6851955 (Why is no real title available?)
- scientific article; zbMATH DE number 910713 (Why is no real title available?)
- scientific article; zbMATH DE number 7269246 (Why is no real title available?)
- A New Type System for Deadlock-Free Processes
- A graphical approach to progress for structured communication in web services
- A theory of contracts for strong service compliance
- A type system for lock-free processes
- Deadlock analysis of unbounded process networks
- Deadlock and lock freedom in the linear \(\pi\)-calculus
- Fair subtyping for multi-party session types
- Fair subtyping for open session types
- Fairness and hyperfairness
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- Fundamental properties of infinite trees
- Generalizing inference systems by coaxioms
- Global progress for dynamically interleaved multiparty sessions
- Linear logic propositions as session types
- Linear logical relations for session-based concurrency
- Multiparty Asynchronous Session Types
- Multiparty asynchronous session types
- Multiparty session types as coherence proofs
- Observational equivalence for multiparty sessions
- Precise subtyping for synchronous multiparty sessions
- Propositions as sessions
- Proving Liveness Properties of Concurrent Programs
- Session types revisited
- Subtyping Supports Safe Session Substitution
- Subtyping for session types in the pi calculus
- Taking linear logic apart
- Talking bananas: structural recursion for session types
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)
