Partial typing for asynchronous multiparty sessions

DOI10.4204/EPTCS.408.1MaRDI QIDQ6934060zbMATH OpenFDO

Authors Franco Barbanera, Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.408.1

zbMATH Keywords

asynchronous communicationlock-freedommultiparty session types

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A type system for lock-free processes
• Deadlock and lock freedom in the linear -calculus
• Deconfined Global Types for Asynchronous Sessions
• Fundamental approaches to software engineering. 20th international conference, FASE 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22--29, 2017. Proceedings
• Fundamental properties of infinite trees
• Global types with internal delegation
• Multiparty Asynchronous Session Types
• Multiparty asynchronous session types
• Nested protocols in session types
• Partially Typed Multiparty Sessions
• Reversible sessions with flexible choices
• Types and programing languages

Cited in

(1)

• Open compliance in multiparty sessions with partial typing

This page was built for publication: Partial typing for asynchronous multiparty sessions

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