Constraints for Service Contracts

This paper focuses on client-service interactions distinguishing between three phases: negotiate, commit and execute. The participants negotiate their behaviours, and if an agreement is reached they commit and start an execution which is guaranteed to respect the interaction scheme agreed upon. These ideas are materialised through a calculus of contracts enriched with semiring-based constraints, which allow clients to choose services and to interact with them in a safe way. A concrete representation of these constraints with logic programs is straightforward, thus reducing constraint solution (and consequently the establishment of a contract) to the execution of a logic program.

[1]  Ugo Montanari,et al.  QoS negotiation in service composition , 2011, J. Log. Algebraic Methods Program..

[2]  Cosimo Laneve,et al.  The Must Preorder Revisited , 2007, CONCUR.

[3]  Luca Padovani.  Contract-Directed Synthesis of Simple Orchestrators , 2008, CONCUR.

[4]  Mariangiola Dezani-Ciancaglini,et al.  Sessions and Session Types: An Overview , 2009, WS-FM.

[5]  Fabio Gadducci,et al.  Enhancing Constraints Manipulation in Semiring-Based Formalisms , 2006, ECAI.

[6]  Mariangiola Dezani-Ciancaglini,et al.  On Progress for Structured Communications , 2007, TGC.

[7]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[8]  Francesca Rossi,et al.  Semiring-based constraint logic programming: syntax and semantics , 2001, TOPL.

[9]  Cosimo Laneve,et al.  The must preorder revisited: an algebraic theory for web services contracts , 2007 .

[10]  Mariangiola Dezani-Ciancaglini,et al.  Structured Communications with Concurrent Constraints , 2008, TGC.

[11]  Kohei Honda,et al.  An Interaction-based Language and its Typing System , 1994, PARLE.

[12]  Loris D'Antoni,et al.  Global Progress in Dynamically Interleaved Multiparty Sessions , 2008, CONCUR.

[13]  Naoki Kobayashi.  Type-based information flow analysis for the π-calculus , 2005, Acta Informatica.

[14]  H. Cheng.  Calculus of Communicating Systems : a synopsis Mantis , 1994 .

[15]  Mario Bravetti,et al.  A theory of contracts for strong service compliance , 2009, Mathematical Structures in Computer Science.

[16]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[17]  Maria Grazia Buscemi,et al.  Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007, Proceedings , 2007, European Symposium on Programming.

[18]  Vasco Thudichum Vasconcelos.  Sessions, from Types to Programming Languages , 2011, Bull. EATCS.

[19]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[20]  Luca Padovani,et al.  On Global Types and Multi-party Sessions , 2011, FMOODS/FORTE.

[21]  Luca Padovani,et al.  A theory of contracts for Web services , 2007, TOPL.

[22]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[23]  Jakob Rehof,et al.  Conformance Checking for Models of Asynchronous Message Passing Software , 2002, CAV.

[24]  Stefano Bistarelli,et al.  A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation , 2009, VODCA@FOSAD.

[25]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.