Deconfined Global Types for Asynchronous Sessions

Dagnino, Francesco; Giannini, Paola; Dezani‐Ciancaglini, Mariangiola

doi:10.1007/978-3-030-78142-2_3

Cited by 6 publications

(15 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed this is the running example of [BCL + 21], where a decidable restriction of asynchronous subtyping is presented. In addition this example is typable neither in [CDG21] nor in [DGD21].…”

Section: Introductionmentioning

confidence: 84%

“…To the best of our knowledge global types with split outputs and inputs are considered only in [CDG21,DGD21]. The above network can be typed in [DGD21], but not in [CDG21].…”

Section: Related and Future Workmentioning

confidence: 99%

“…To the best of our knowledge global types with split outputs and inputs are considered only in [CDG21,DGD21]. The above network can be typed in [DGD21], but not in [CDG21]. In these papers there is no choice of inputs and the running example of the current paper cannot be typed.…”

Section: Related and Future Workmentioning

confidence: 99%

“…In these papers there is no choice of inputs and the running example of the current paper cannot be typed. The present work springs from [DGD21], but with many improvements:…”

Section: Related and Future Workmentioning

confidence: 99%

“…In the present paper (which is the journal version of [DGD21]) we extend the syntax of global types in [CDG21], significantly enlarging the set of allowed global types which are well formed. In this way we obtain a decidable type system in which we are able to type also an example requiring a subtyping which fails for the algorithm in [BCL + 21].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Deconfined Global Types for Asynchronous Sessions

Dagnino¹,

Giannini²,

Dezani‐Ciancaglini³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Multiparty sessions with asynchronous communications and global types play an important role for the modelling of interaction protocols in distributed systems. In designing such calculi the aim is to enforce, by typing, good properties for all participants, maximising, at the same time, the behaviours accepted. The global types presented in this paper improve the state-of-the-art by extending the set of typable asynchronous sessions and preserving decidability of type checking together with the key properties of Subject Reduction, Session Fidelity and Progress. Our type system is equipped with a type inference algorithm returning global types to be checked against well-formedness conditions. This original research has the financial support of the Università del Piemonte Orientale.

show abstract

Section: Introductionmentioning

confidence: 84%

“…To the best of our knowledge global types with split outputs and inputs are considered only in [CDG21,DGD21]. The above network can be typed in [DGD21], but not in [CDG21].…”

Section: Related and Future Workmentioning

confidence: 99%

Section: Related and Future Workmentioning

confidence: 99%

“…In these papers there is no choice of inputs and the running example of the current paper cannot be typed. The present work springs from [DGD21], but with many improvements:…”

Section: Related and Future Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Deconfined Global Types for Asynchronous Sessions

Dagnino¹,

Giannini²,

Dezani‐Ciancaglini³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Asynchronous Global Types in Co-logic Programming

Bianchini

Dagnino

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Complete Multiparty Session Type Projection with Automata

Stutz

Wies

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols. Central to MSTs is a projection operator: a partial function that maps protocols represented as global types to correct-by-construction implementations for each participant, represented as a communicating state machine. Existing projection operators are syntactic in nature, and trade efficiency for completeness. We present the first projection operator that is sound, complete, and efficient. Our projection separates synthesis from checking implementability. For synthesis, we use a simple automata-theoretic construction; for checking implementability, we present succinct conditions that summarize insights into the property of implementability. We use these conditions to show that MST implementability is PSPACE-complete. This improves upon a previous decision procedure that is in EXPSPACE and applies to a smaller class of MSTs. We demonstrate the effectiveness of our approach using a prototype implementation, which handles global types not supported by previous work without sacrificing performance.

show abstract

Deconfined Global Types for Asynchronous Sessions

Cited by 6 publications

References 20 publications

Deconfined Global Types for Asynchronous Sessions

Deconfined Global Types for Asynchronous Sessions

Asynchronous Global Types in Co-logic Programming

Complete Multiparty Session Type Projection with Automata

Contact Info

Product

Resources

About