swMATH ID: 15033
Software Authors: Maria Grazia Buscemi, Ugo Montanari
Description: CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Service (cost, performance, availability, etc.). In this work we propose a simple model of contracts for QoS and SLAs that also allows to study mechanisms for resource allocation and for joining different SLA requirements. Our language combines two basic programming paradigms: name-passing calculi and concurrent constraint programming (cc programming). Specifically, we extend cc programming by adding synchronous communication and by providing a treatment of names in terms of restriction and structural axioms closer to nominal calculi than to variables with existential quantification. In the resulting framework, SLA requirements are constraints that can be generated either by a single party or by the synchronisation of two agents. Moreover, restricting the scope of names allows for local stores of constraints, which may become global as a consequence of synchronisations. Our approach relies on a system of named constraints that equip classical constraints with a suitable algebraic structure providing a richer mechanism of constraint combination. We give reduction-preserving translations of both cc programming and the calculus of explicit fusions.
Homepage: http://link.springer.com/chapter/10.1007/978-3-540-71316-6_3
Related Software: COWS; Isabelle/HOL; Nominal Isabelle; Scribble; PiDuce; Psi-calculi; Archive Formal Proofs; Oz; LARVA; XPi; Maude; SLMC; Paco; PoplMark; HOL; Isar; Isabelle/Isar; ML; Isabelle; Coq
Cited in: 28 Documents

Citations by Year