Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/12783
Title: Three algorithms and a methodology for amending contracts for choreographies
Authors: Bocchi, Laura
Lange, Julien
Tuosto, Emilio
First Published: 2012
Citation: Scientific Annals of Computer Science, 2012, 22 (1), pp. 61-104
Abstract: 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.
DOI Link: 10.7561/SACS.2012.1.61
ISSN: 1843-8121
Links: http://hdl.handle.net/2381/12783
Type: Journal Article
Rights: Copyright © Scientific Annals of Computer Science, 2012
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.