Academic Journals Database
Disseminating quality controlled scientific knowledge

Three Algorithms and a Methodology for Amending Contracts for Choreographies

Author(s): L. Bocchi | J. Lange | E. Tuosto

Journal: Scientific Annals of Computer Science
ISSN 1843-8121

Volume: 22;
Issue: 1;
Start page: 61;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: multiparty session types | design-by-contract | assertions | choreography | satisfiability

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.
RPA Switzerland

RPA Switzerland

Robotic process automation


Tango Rapperswil
Tango Rapperswil