Lightening global types

Chen, Tzu‐Chun

doi:10.1016/j.jlamp.2015.06.003

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One challenge in decomposing a multiparty session type is preserving its sequencing information. The work [9] shows how to decompose a global type into simpler, independent pieces: global types use an additional calls construct to invoke these pieces in the appropriate order, but connections with binary sessions are not established. Correspondence assertions [2] track data dependencies and detect unintended operations; they may allow to relate independent binary sessions.…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

Multiparty Session Types Within a Canonical Binary Theory, and Beyond

Caires¹,

Pérez²

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

A widespread approach to software service analysis uses session types. Very different type theories for binary and multiparty protocols have been developed; establishing precise connections between them remains an open problem. We present the first formal relation between two existing theories of binary and multiparty session types: a binary system rooted in linear logic, and a multiparty system based on automata theory. Our results enable the analysis of multiparty protocols using a (much simpler) type theory for binary protocols, ensuring protocol fidelity and deadlock-freedom. As an application, we offer the first theory of multiparty session types with behavioral genericity. This theory is natural and powerful; its analysis techniques reuse results for binary session types.

show abstract

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

Multiparty Session Types Within a Canonical Binary Theory, and Beyond

Caires¹,

Pérez²

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

show abstract

“…Also the notion of conformance between parties defined by Baldoni et al may be a basis for proposing methods and algorithms for devising whether a set of projected protocols expressed in our formalism for constrained global types can be used to verify the same properties as the global one. [11] shares with ours the purpose of moving from global types to global types, in order to "lighten" the original global type.…”

Section: State Of the Artmentioning

confidence: 99%

Efficient Verification of MASs with Projections

Ancona

Briola

Seghrouchni

et al. 2014

Engineering Multi-Agent Systems

View full text Add to dashboard Cite

Constrained global types are a powerful means to represent agent interaction protocols. In our recent research we demonstrated that they can be used to represent complex protocols in a very compact way, and we exploited them to dynamically verify the correct implementation of a protocol in two real MAS frameworks, Jason and JADE. The main drawback of our previous approach is the full centralization of the monitoring activity, which is delegated to a unique monitor agent. This approach works well for MASs with few agents, but could become unsuitable in communication-intensive and highly-distributed MASs where hundreds of agents should be monitored. In this paper we define an algorithm for projecting a constrained global type onto a set of agents Ags, by restricting it to the interactions involving agents in Ags, so that the outcome of the algorithm is another constrained global type that can be safely used for verifying the compliance of the sub-system Ags to the protocol specified by the original constrained global type. The projection mechanism is the first step towards distributing the monitoring activity, making it safer and more efficient: the compliance of a MAS to a protocol could be dynamically verified by suitably partitioning the agents of the MAS into small sets of agents, and by assigning to each partition Ags a local monitor agent which checks all interactions involving Ags against the projected constrained global type

show abstract

Less is more: multiparty session types revisited

Scalas

Yoshida

2019

Proc. ACM Program. Lang.

120

View full text Add to dashboard Cite

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 theory removes such restrictions and fixes such flaws. (2) We contribute a new MPST theory that is less complicated, and yet more general, than the classic one: it does not require global multiparty session types nor binary session type duality Ð instead, it is grounded on general behavioural type-level properties, and proves type safety of many more protocols and processes. (3) We produce a detailed analysis of type-level properties, showing how, in our new theory, they allow to ensure decidability of type checking, and statically guarantee that processes enjoy, e.g., deadlock-freedom and liveness at run-time. (4) We show how our new theory can integrate type and model checking: type-level properties can be expressed in modal µ-calculus, and verified with well-established tools. CCS Concepts: • Theory of computation → Process calculi; Type structures; Verification by model checking;

show abstract

Lightening global types

Cited by 3 publications

References 21 publications

Multiparty Session Types Within a Canonical Binary Theory, and Beyond

Multiparty Session Types Within a Canonical Binary Theory, and Beyond

Efficient Verification of MASs with Projections

Less is more: multiparty session types revisited

Contact Info

Product

Resources

About