CC-Pi: A constraint-based language for specifying service level agreements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4421 LNCS, Issue , 2007, Pages 18-32

  Buscemi, Maria Grazia ^a   Montanari, Ugo ^b  

^a IMT SCHOOL FOR ADVANCED STUDIES LUCCA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; QUALITY OF SERVICE; RESOURCE ALLOCATION; SEMANTICS; TRANSLATION (LANGUAGES);

CONCURRENT CONSTRAINT PROGRAMMING; SERVICE LEVEL AGREEMENTS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 37149017073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_3     Document Type: Conference Paper

References (19)

1. A. Bacciu, A. Botta, and H. Melgratti. A fuzzy approach for negotiating quality of services. In Proc. TGC '06. To appear.
2. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2):201-236, 1997.
3. S. Bistarelli, U. Montanari, and F. Rossi. Soft concurrent constraint programming. ACM Trans. Comput. Logic, 7(3):563-589, 2006.
4. R. De Nicola, G. Ferrari, U. Montanari, R. Pugliese, and E. Tuosto. A process calculus for QoS-aware applications. In Proc. COORDINATION'05, volume 3454 of Led. Notes in Comput. Sci. Springer, 2005.
5. J. F. Diaz, C. Rueda, and F. Valencia. A calculus for concurrent processes with constraints. CLEI Electronic Journal, 1(2), 1998.
6. A. Keller and H. Ludwig. The WSLA framework: Specifying and monitoring service level agreements for web services. Jour. Net. and Sys. Manag., 11(1):57-81, 2003.
7. R. Milner, J. Parrow, and J. Walker. A calculus of mobile processes, I and II. Inform, and Comput, 100(1):l-40,41-77, 1992.
8. U. Montanari. Networks of constraints: fundamental properties and application to picture processing. Information Science, 1:95-132, 1974.
9. U. Montanari and Pistore M. Structured coalgebras and minimal hd-automata for the picalculus. Theoret. Comput. Sci, 340(3):539-576, 2005.
10. U. Montanari and F. Rossi. Constraint relaxation may be perfect. Artif. Intell, 48(2): 143170, 1991.
11. J. Niehren and M. Mueller. Constraints for free in concurrent computation. In Proc. Asian '95, volume 1023 of Lect. Notes in Comput. Sci. Springer, 1995.
12. M. Nielsen, C. Palamidessi, and F. Valencia. On the expressive power of temporal concurrent constraint programming languages. In Proc. PPDP'02. ACM, 2002.
13. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proc. LICS'98. IEEE, Computer Society Press, 1998.
14. V. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming, 1992. Technical Report, Xerox Pare.
15. V. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. POPL'90. ACM Press, 1990.
16. V. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. POPL'91. ACM Press, 1991.
17. J. Skene, D. Lamanna, and W. Emmerich. Precise service level agreements. In Proc. ICSE'04, 2004.
18. B. Victor and J. Parrow. Constraints as processes. In Proc. CONCUR'96, volume 1119 of Lect. Notes in Comput. Sci. Springer, 1996.
19. L. Wischikand P. Gardner. Explicit fusions. Theoret. Comput. Sci, 340(3):606-630, 2005.