A Sound Algorithm for Asynchronous Session Subtyping

DOI10.4230/LIPIcs.CONCUR.2019.38OpenAlexW2970500863MaRDI QIDQ5875400

Nobuko Yoshida, Julien Lange, Mario Bravetti, Marco Carbone, Gianluigi Zavattaro

Publication date: 3 February 2023

Full work available at URL: https://hal.inria.fr/hal-02387473

zbMATH Keywords

algorithmconcurrencysubtypingsession types

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Precise Subtyping for Asynchronous Multiparty Sessions ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Session Types with Arithmetic Refinements

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of a class of communicating finite state machines
• On the boundary between decidability and undecidability of asynchronous session subtyping
• Unreliable channels are easier to verify than perfect channels
• Verifying programs with unreliable channels
• Characteristic formulae for session types
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• Undecidability of asynchronous session subtyping
• Subtyping for session types in the pi calculus
• Effects as sessions, sessions as effects
• Multiparty Session Types Meet Communicating Automata
• On the Undecidability of Asynchronous Session Subtyping
• Decidable Topologies for Communicating Automata with FIFO and Bag Channels
• Global Principal Typing in Partially Commutative Asynchronous Sessions
• On Communicating Finite-State Machines
• Efficient recursive subtyping
• Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
• A simple library implementation of binary sessions
• Context-Bounded Analysis of Concurrent Queue Systems
• A Sound Algorithm for Asynchronous Session Subtyping

This page was built for publication: A Sound Algorithm for Asynchronous Session Subtyping