Skip to main content

Amending Contracts for Choreographies

Bocchi, Laura, Lange, Julien, Tuosto, E. (2011) Amending Contracts for Choreographies. In: Electronic Proceedings in Theoretical Computer Science. Proceedings Fourth Interaction and Concurrency Experience. 59. pp. 111-129. (doi:10.4204/EPTCS.59.10) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.4204/EPTCS.59.10

Abstract

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.

Item Type: Conference or workshop item (Proceeding)
DOI/Identification number: 10.4204/EPTCS.59.10
Subjects: Q Science
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Depositing User: Julien Lange
Date Deposited: 12 Jul 2017 15:53 UTC
Last Modified: 29 May 2019 19:12 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/62260 (The current URI for this page, for reference purposes)
Bocchi, Laura: https://orcid.org/0000-0002-7177-9395
  • Depositors only (login required):