Dynamically Updatable Multiparty Session Protocols
Multiparty Session Types (MPST) are a typing discipline that guarantees the absence of deadlocks and communication errors in concurrent and distributed systems. However, existing MPST frameworks do not support protocols with dynamic unbounded participants, and cannot express many common programming patterns that require the introduction of new participants into a protocol. This can pose a barrier for the adoption of MPST-based techniques to programming languages that favour the creation of new participants (processes, lightweight threads, etc) that communicate via message passing, such as Go or Erlang.
This paper proposes dynamically updatable unbounded multiparty session protocols, a new session types theory (DMst) that supports protocols with an unbounded number of fresh participants, whose communication structures are dynamically updatable during a protocol execution. We prove that DMst guarantees deadlock-freedom and liveness. We implement a toolchain, GoScr (Go-Scribble), which generates Go implementations from DMst, ensuring by construction, that the different participants will only perform I/O actions that comply with a given protocol specification. We evaluate our toolchain by (1) implementing representative parallel and concurrent algorithms from existing benchmarks, textbooks and literature; (2) showing that GoScr does not introduce significant overheads compared to a naive implementation, for computationally expensive benchmarks; and (3) building three realistic protocols (dynamic task delegation, recursive Domain Name System, and a parallel Min-Max strategy) in GoScr that could not be represented with previous theories of session types.
Wed 19 JulDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 17:00
|Synthetic Behavioural Typing: Sound, Regular Multiparty Sessions via Implicit Local Types
Sung-Shik Jongmans Open University of the Netherlands; CWI, Francisco Ferreira Royal Holloway, University of LondonDOI
|Asynchronous Multiparty Session Type Implementability is Decidable – Lessons Learned from Message Sequence Charts
Felix Stutz MPI-SWSDOI
|Dynamically Updatable Multiparty Session Protocols
|Designing Asynchronous Multiparty Protocols with Crash-Stop Failures
Adam D. Barwell University of St Andrews and University of Oxford, Ping Hou University of Oxford, Nobuko Yoshida University of Oxford, Fangyi Zhou Imperial College LondonDOI Pre-print
|ConDRust: Scalable Deterministic Concurrency from Verifiable Rust Programs
Felix Suchert Center for Advancing Electronics Dresden, TU Dresden, Lisza Zeidler Composable Operating Systems Group, Barkhausen Institute, Dresden, Jeronimo Castrillon TU Dresden, Germany, Sebastian Ertel Composable Operating Systems Group, Barkhausen Institute, DresdenDOI
|Information Flow Analysis for Detecting Non-Determinism in Blockchain
Luca Olivieri Ca’ Foscari University of Venice, Vincenzo Arceri University of Parma, Italy, Luca Negrini Ca’ Foscari University of Venice, Corvallis S.r.l., Fabio Tagliaferro CYS4 Srl, Pietro Ferrara Università Ca' Foscari, Venezia, Italy, Agostino Cortesi Università Ca' Foscari Venezia, Fausto Spoto U. VeronaDOI