Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, II
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
The WSLA Framework: Specifying and Monitoring Service Level Agreements for Web Services
Journal of Network and Systems Management
Precise Service Level Agreements
Proceedings of the 26th International Conference on Software Engineering
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Mathematical foundations of computer science 2000
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
A concurrent calculus with atomic transactions
ESOP'07 Proceedings of the 16th European conference on Programming
A fuzzy approach for negotiating quality of services
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
Liveness of communicating transactions
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
| Hi-index | 0.00 |
Several models based on process calculi have addressed the definition of linguistic primitives for handling long running transactions and Service Level Agreement (SLA) in service oriented applications. Nevertheless, the approaches appeared in the literature deal with these aspects as independent features. We claim that transactional mechanisms are relevant for programming multistep SLA negotiations and, hence, it is worth investigating the interplay among such formal approaches. In this paper we propose a process calculus, the committed cc-pi, that combines two proposals: (i) cc-pi calculus accounting for SLA negotiation and (ii) cJoin as a model of long running transactions. We provide both a small- and a big-step operational semantics of committed cc-pi as labelled transition systems, and we prove a correspondence result.