Three Algorithms and a Methodology for Amending Contracts for Choreographies

Scientific Annals of Computer Science

article

L. Bocchi¹  J. Lange¹  E. Tuosto¹ 

[1] Department of Computer Science, University of Leicester, University Road

关键词: multiparty session types;    design-by-contract;    assertions;    choreography;    satisfiability;   

DOI  :  10.7561/SACS.2012.1.61

来源: Alexandru Ioan Cuza University of Iasi

【 摘 要 】

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.

【 授权许可】

CC BY-ND