Deadlock-free asynchronous message reordering in rust with multiparty session types

Cutner, Zak; Yoshida, Nobuko; Vassor, Martin

doi:10.1145/3503221.3508404

Cited by 17 publications

(6 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their approach does not address the issues in Section 1, though, whereas our approach does. Previous attempts to address the issue of "mixed static/dynamic checks" either target a programming language with a stronger type system (Rust) [22,8,23,9], or adopt callback-style APIs in the specific context of event-based programming [35,34]. In contrast, our approach does not rely on (the strength of) the type system of the targeted programming language, and it supports traditional procedural/object-oriented programming.…”

Section: Discussionmentioning

confidence: 99%

“…A premier approach to apply the MPST method in combination with mainstream programming languages is based on API generation (Figure 5); it is used in the majority of MPST tools, including Scribble [16,17], its extensions [32,5,25,22,8,23,9,27,35], StMungo [21], νScr [34], mpstpp [20], and Pompset [6]. The main ideas, first conceived by Deniélou/Hu/Yoshida and pursued in Scribble, follow two insights: (a) local types can be interpreted as deterministic finite automata (DFA) [10,11], where every transition models a send/receive action; (b) DFAs can be encoded as object-oriented application programming interfaces (API) [16,17], where classes and methods model states and transitions.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Multiparty Session Typing in Java, Deductively

Bouma

Gouw

Jongmans

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multiparty session typing (MPST) is a method to automatically prove safety and liveness of protocol implementations relative to specifications. We present BGJ: a new tool to apply the MPST method in combination with Java. The checks performed using our tool are purely static (all errors are reported early at compile-time) and resource-efficient (near-zero cost abstractions at run-time), thereby addressing two issues of existing tools. BGJ is built using VerCors, but our approach is general.

show abstract

Section: Discussionmentioning

confidence: 99%

mentioning

confidence: 99%

Multiparty Session Typing in Java, Deductively

Bouma

Gouw

Jongmans

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Intuitively, subtyping studies how to give freedom in the implementation while preserving the correctness properties. The intra-role indistinguishability relation ≈, which allows to reorder receive events for a role, resembles subtyping to some extent, e.g., the work by Cutner et al [25]. A detailed investigation of this relation is beyond the scope of this work.…”

Section: Implementability With Intra-role Reordering Is Undecidablementioning

confidence: 95%

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

Stutz

Zufferey

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Communicating state machines provide a formal foundation for distributed computation. Unfortunately, they are Turing-complete and, thus, challenging to analyse. In this paper, we classify restrictions on channels which have been proposed to work around the undecidability of verification questions. We compare half-duplex communication, existential B-boundedness, and k-synchronisability. These restrictions do not prevent the communication channels from growing arbitrarily large but still restrict the power of the model. Each restriction gives rise to a set of languages so, for every pair of restrictions, we check whether one subsumes the other or if they are incomparable. We investigate their relationship in two different contexts: first, the one of communicating state machines, and, second, the one of communication protocol specifications using high-level message sequence charts. Surprisingly, these two contexts yield different conclusions. In addition, we integrate multiparty session types, another approach to specify communication protocols, into our classification. We show that multiparty session type languages are half-duplex, existentially 1-bounded, and 1-synchronisable. To show this result, we provide the first formal embedding of multiparty session types into high-level message sequence charts.

show abstract

“…The top-down approach enables correctness-byconstruction: a developer provides a global description for the whole protocol; by projecting the global protocol, APIs are generated from local CFSMs, which ensure the safe implementation of each participant. MPSTs toolchains that take the top-down approach have seen multiple implementations and targeted a variety of mainstream programming languages, such as (in no particular order) Java [23,24,30], OCaml [26], Go [8], Scala [42,46], F# [36], F [48] and Rust [10,31]. Like CAScr, most of the above implementations rely on the Scribble protocol description language [20,37,47] (http://www.scribble.org, https://nuscr.dev/).…”

Section: Related Workmentioning

confidence: 99%

Design-by-Contract for Flexible Multiparty Session Protocols -- Extended Version

Gheri¹,

Lanese²,

Neil³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Choreographic models support a correctness-by-construction principle in distributed programming. Also, they enable the automatic generation of correct message-based communication patterns from a global specification of the desired system behaviour. In this paper we extend the theory of choreography automata, a choreographic model based on finite-state automata, with two key features. First, we allow participants to act only in some of the scenarios described by the choreography automaton. While this seems natural, many choreographic approaches in the literature, and choreography automata in particular, forbid this behaviour. Second, we equip communications with assertions constraining the values that can be communicated, enabling a design-by-contract approach. We provide a toolchain allowing to exploit the theory above to generate APIs for TypeScript web programming. Programs communicating via the generated APIs follow, by construction, the prescribed communication pattern and are free from communication errors such as deadlocks. ACM Subject ClassificationTheory of computation → Distributed computing models; Software and its engineering → Formal software verification Keywords and phrases Choreography automata, design by contract, deadlock freedom, Communicating Finite State Machines, TypeScript programming Digital Object Identifier 10.4230/LIPIcs...

show abstract

Deadlock-free asynchronous message reordering in rust with multiparty session types

Cited by 17 publications

References 42 publications

Multiparty Session Typing in Java, Deductively

Multiparty Session Typing in Java, Deductively

Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types

Design-by-Contract for Flexible Multiparty Session Protocols -- Extended Version

Contact Info

Product

Resources

About