Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types

Yoshida, Nobuko; Zhou, Fangyi; Ferreira, Francisco

doi:10.1007/978-3-030-86593-1_2

Cited by 9 publications

(16 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We showcase the main theoretical results and constructions in this paper with a tool, CAScr, the first implementation of Scribble [20,37,47] that relies on c-automata, for deadlock-free distributed programming. CAScr takes the popular top-down approach to system development based on choreographic models, following the original methodology of Scribble and multiparty session types [21].…”

Section: Typescript Programming Via Flexible C-automatamentioning

confidence: 96%

“…The last contribution is a toolchain, dubbed CAScr, based on the theory of c-automata with selective participation developed in this paper. More precisely, CAScr allows one to specify a protocol using the Scribble framework [20,37,47] and to check its well-formedness relying on our theory. Finally, CAScr generates TypeScript APIs to implement the roles of the original protocol.…”

Section: Xx:4mentioning

confidence: 99%

“…§ 5 presents CAScr, a novel, full toolchain-from the Scribble [20,37,47] specification of the communication protocol, to the generation of APIs-providing support for distributed web development in TypeScript and relying on flexible c-automata with selective participation.…”

Section: Xx:4mentioning

confidence: 99%

“…The syntax of Scribble (http://www.scribble.org, https://nuscr.dev/) has a straightforward correspondance to the syntax of global types, so Scribble implementations of communicating processes will be supported by multiparty session type theory, and inherit its semantic guarantees. Our development for part (I) of the toolchain is based on the νScr implementation [47], but fundamentally differs from this (and other Scribble versions) in two aspects: the underlying choreographic objects-normating the communication among multiple participants-are not global types, but c-automata, and we allow for participants to join the communication at later stage, only in branches where they are needed (selective participation).…”

Section: Validating Global Protocols With Choreography Automatamentioning

confidence: 99%

“…we have adapted to our theory of c-automata, the codebase of νScr: a recent implementation of Scribble that offers a toolchain for "language-independent code generation" [47]. However, νScr itself does not provide direct support for TypeScript.…”

Section: Api Generation For Distributed Web Developmentmentioning

confidence: 99%

See 4 more Smart Citations

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

Section: Typescript Programming Via Flexible C-automatamentioning

confidence: 96%

Section: Xx:4mentioning

confidence: 99%

Section: Xx:4mentioning

confidence: 99%

Section: Validating Global Protocols With Choreography Automatamentioning

confidence: 99%

Section: Api Generation For Distributed Web Developmentmentioning

confidence: 99%

See 3 more Smart Citations

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

show abstract

ST4MP: A Blueprint of Multiparty Session Typing for Multilingual Programming

Jongmans

Proença

2022

Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles

View full text Add to dashboard Cite

Multiparty session types (MPST) constitute a method to simplify construction and analysis of distributed systems. The idea is that well-typedness of processes at compile-time (statically) entails deadlock freedom and protocol compliance of their sessions of communications at execution-time (dynamically). In practice, the premier approach to apply the MPST method in combination with mainstream programming languages has been based on API generation. However, existing MPST tools support only unilingual programming (homogeneity), while many real-world distributed systems are engineered using multilingual programming (heterogeneity). In this paper, we present a blueprint of ST4MP: a tool to apply the MPST method in multilingual programming, based on API generation. G = m m m_w w w 1 :Work . m m m_w w w 2 :Work . (w w w 1 _m m m:Done . end 9 w w w 2 _m m m:Done . end) Global type p_q:t.G specifies the communication of a value of type t i through the channel from role p to role q, followed by G. Global type G 1 9 G 2 specifies the free interleaving of G 1 and G 2 . Global type end specifies termination.The following local types specify the master (n = 2) and a worker (any n): L m m m = m m mw w w 1 !Work . m m mw w w 2 !Work . (w w w 1 m m m?Done . end 9 w w w 2 m m m?Done . end)L w w wi = m m mw w w i ?Work . w w w i m m m !Done . end Local types pq !t.L and pq?t.L specify the send and receive of a value of type t through the channel from role p to role q, followed by L. Local types L 1 9 L 2 and end are similar to the corresponding forms of global types. In general, a local type L r for role r is mechanically constructed by projecting a global type G onto r, using a recursive function that traverses G's structure. Roughly: every communication in which r participates as sender is preserved as a send in L r ; every communication in which r participates as receiver is preserved as a receive in L r ; every communication in which r does not participate is omitted from L r .The following processes implement the master (n = 2) and a worker (any n): P m m m = m m mw w w 1 !work("grep -o -i foo file.txt | wc -l") . m m mw w w 2 !work("grep -o -i bar file.txt | wc -l") . (w w w 1 m m m? _ :Done . end 9 w w w 2 m m m? _ :Done . end) P w w wi = m m mw w w i ?x:Work . w w w i m m m !do(x) . endProcesses pq !e.P and pq?x:t.P implement the send and receive of the value of expression e (evaluated at the sender) through the channel from role p to role q into variable x of type t (stored at the receiver), followed by P . Processes P 1 9 P 2 and end are similar to the corresponding forms of global/local types.

show abstract

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

Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types

Cited by 9 publications

References 38 publications

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

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

ST4MP: A Blueprint of Multiparty Session Typing for Multilingual Programming

Multiparty Session Typing in Java, Deductively

Contact Info

Product

Resources

About