A Modular Toolkit for Distributed Interactions

Distributed interactions can be suitably designed in terms of choreographies. Such abstractions can be thought of as global descriptions of the coordination of several distributed parties. Global assertions define contracts for choreographies by annotating multiparty session types with logical formulae to validate the content of the exchanged messages. The introduction of such constraints is a critical design issue as it may be hard to specify contracts that allow each party to be able to progress without violating the contract. In this paper, we propose three methods that automatically correct inconsistent global assertions. The methods are compared by discussing their applicability and the relationships between the amended global assertions and the original (inconsistent) ones.Comment: In Proceedings ICE 2011, arXiv:1108.014

show abstract

“…We plan to implement our algorithms and support for the methodology by integrating it in the tool introduced in [7].…”

Section: Discussionmentioning

confidence: 99%

“…Guaranteeing HS and TS is often non-trivial, and this burden is on the software architect; using tools like the ones described in [7], one only highlights the problems but does not help to fix them. HS and TS are global semantic properties that may be hard to achieve.…”

Section: Introductionmentioning

confidence: 99%

Amending Contracts for Choreographies

Bocchi

Lange

Tuosto

2011

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Guaranteeing HS and TS is often non-trivial, and this burden is on the software architect; using tools like the ones described in [9], one only highlights the problems but does not help to fix them. HS and TS are global semantic properties that may be hard to achieve.…”

Section: Three Algorithms and A Methodology For Amending Contracts Fomentioning

confidence: 99%

“…which extends the global assertion in Example 4 and is supposed to be designed by the architect (step (i) of the methodology). Firstly, G is inspected by history sensitivity and temporal satisfiability checkers, such as the ones described in [9]. If any HS problems are reported (step (ii) of the methodology), algorithms Σ and Π are used, while Λ is used for TS problems.…”

Section: A Methodology For Amending Choreographiesmentioning

confidence: 99%

See 1 more Smart Citation

Three Algorithms and a Methodology for Amending Contracts for Choreographies

Bocchi¹,

Lange²,

Tuosto³

2012

SACS

Self Cite

View full text Add to dashboard Cite

Distributed interactions are crucial design aspects to consider in modern applications. They can be suitably designed in terms of choreographies, that are global descriptions of the coordination of several distributed parties. Global assertions define contracts for choreographies by annotating multiparty session types with logical formulae to validate the content of the exchanged messages. The introduction of such constraints is a critical design issue as it may be hard to specify contracts that allow each party to be able to progress without violating the contract. We propose three algorithms to correct inconsistent global assertions. The methods are compared by discussing their applicability and the relationships between the amended global assertions and the original (inconsistent) ones. Also, we specify a methodology that exploits our algorithms to help designers to amend their choreographies. To show how the methodology can be applied we consider a simple scenario.

show abstract

Synthesising Choreographies from Local Session Types

Lange

Tuosto

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Designing and analysing multiparty distributed interactions can be achieved either by means of a global view (e.g. in choreography-based approaches) or by composing available computational entities (e.g. in service orchestration). This paper proposes a typing systems which allows, under some conditions, to synthesise a choreography (i.e. a multiparty global type) from a set of local session types which describe end-point behaviours (i.e. local types).is the behaviour of b 1 P 2 = t 2 !order.p 2 ?price.r!price.(c 2 ?.t 2 !addr + c 1 ?.no 2 !) is the behaviour of b 2 S i = t i ?order.p i !price.(t i ?addr + no i ?), i ∈ {1, 2} is the behaviour of s i with a!e (resp. a?e) representing the action of sending (resp. receiving) a message of type e on a channel a (we omit e when the message is immaterial), ⊕ representing an internal choice, and + a choice made by the environment.

show abstract

A Modular Toolkit for Distributed Interactions

Cited by 4 publications

References 17 publications

Amending Contracts for Choreographies

Amending Contracts for Choreographies

Three Algorithms and a Methodology for Amending Contracts for Choreographies

Synthesising Choreographies from Local Session Types

Contact Info

Product

Resources

About