scispace - formally typeset
Search or ask a question

Showing papers by "Luís Caires published in 2009"


Book ChapterDOI
28 Mar 2009
TL;DR: It is proved that well-typed systems never violate the prescribed conversation constraints, and techniques to ensure progress of systems involving several interleaved conversations are presented, a previously open problem.
Abstract: We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able to uniformly describe both the internal and the interface behavior of systems, referred respectively as choreographies and contracts in web-services terminology. The notion of conversation builds on the fundamental concept of session, but generalizes it along directions up to now unexplored; in particular, conversation types discipline interactions in conversations while accounting for dynamical join and leave of an unanticipated number of participants. We prove that well-typed systems never violate the prescribed conversation constraints. We also present techniques to ensure progress of systems involving several interleaved conversations, a previously open problem.

47 citations


Book ChapterDOI
05 Apr 2009
TL;DR: By embedding in the Conversation Calculus certain structured compensation programming abstractions inspired by the ones proposed by Butler, Ferreira, and Hoare, the correctness of the embedding is proved after developing a general notion of stateful model for structured compensations and related results, and showing that the embedded model induces such a model.
Abstract: Conversations in service-oriented computation are frequently long running. In such a setting, traditional ACID properties of transactions cannot be reasonably implemented, and compensation mechanisms seem to provide convenient techniques to, at least, approximate them. In this paper, we investigate the representation and analysis of structured compensating transactions within a process calculus model, by embedding in the Conversation Calculus certain structured compensation programming abstractions inspired by the ones proposed by Butler, Ferreira, and Hoare. We prove the correctness of the embedding after developing a general notion of stateful model for structured compensations and related results, and showing that the embedding induces such a model.

37 citations