2019
DOI: 10.1145/3290343
|View full text |Cite
|
Sign up to set email alerts
|

Less is more: multiparty session types revisited

Abstract: Multiparty Session Types (MPST) are a typing discipline ensuring that a message-passing process implements a given multiparty session protocol, without errors. In this paper, we propose a new, generalised MPST theory. Our contribution is fourfold. (1) We demonstrate that a revision of the theoretical foundations of MPST is necessary: classic MPST have a limited subject reduction property, with inherent restrictions that are easily overlooked, and in previous work have led to flawed type safety proofs; our new … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
134
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
5
2

Relationship

5
2

Authors

Journals

citations
Cited by 87 publications
(134 citation statements)
references
References 35 publications
0
134
0
Order By: Relevance
“…We can transparently widen the set of safe programs captured by these tools by using k-mc instead of synchronous multiparty compatibility (smc). The k-mc condition corresponds to a much wider instance of the abstract safety invariant ϕ for session types defined in [64]. Indeed k-mc includes smc (see Appendix H) and all finite-state systems (for k sufficiently large).…”
Section: Related Workmentioning
confidence: 99%
“…We can transparently widen the set of safe programs captured by these tools by using k-mc instead of synchronous multiparty compatibility (smc). The k-mc condition corresponds to a much wider instance of the abstract safety invariant ϕ for session types defined in [64]. Indeed k-mc includes smc (see Appendix H) and all finite-state systems (for k sufficiently large).…”
Section: Related Workmentioning
confidence: 99%
“…The idea is that properties model-checked on the types carry over to the processes. Similarly, Scalas and Yoshida [51] use mCRL2 to model-check session environments, as a more expressive alternative to the classical consistency condition needed to prove subject reduction. Note that [51,Theorem 5.15] shows that, in the case that a set of processes is typable by a single multiparty session (i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Similarly, Scalas and Yoshida [51] use mCRL2 to model-check session environments, as a more expressive alternative to the classical consistency condition needed to prove subject reduction. Note that [51,Theorem 5.15] shows that, in the case that a set of processes is typable by a single multiparty session (i.e. a single global type), type-level properties including safety, deadlock-freedom and liveness guarantee the same properties for multiparty session π-processes.…”
Section: Related Workmentioning
confidence: 99%
“…Our protocols-as-types are related to session types [11,26,27,69], and their combination with value-dependent and indexed types [10,14,[75][76][77]; session types have inspired various implementations [3], also in Scala [65][66][67][68]. Our theory has a different design, yielding different features.…”
Section: Conclusion and Related Workmentioning
confidence: 99%