A theory of contracts for web services

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 5, 2009, Pages

  Castagna, Giuseppe ^a   Gesbert, Nils ^b   Padovani, Luca ^c  

^a CNRS   (France)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c UNIVERSITY OF URBINO   (Italy)

Author keywords

Ccs; Concurrency theory; Contracts; Explicit coercions; Must testing; Subtyping; Type theory; Web services

Indexed keywords

CCS; CONCURRENCY THEORY; EXPLICIT COERCIONS; MUST TESTING; SUBTYPING; TYPE THEORY;

LINGUISTICS; QUERY LANGUAGES;

WEB SERVICES;

EID: 68549111018     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1538917.1538920     Document Type: Article

References (48)

1. ALVES, A., ARKIN, A., ASKARY, S., BARRETO, C., ET AL. 2007. Web Services Business Process Execution Language Version 2.0. OASIS Standard, http://docs.oasis-open.org/ wsbpel/2.0/OS/wsbpel-v2.0-0S.html.
2. BAETEN, J. C. M., CORRADINI, F., AND GRABMAYER, C. A. 2007. A characterization of regular expressions under bisimulation. J. ACM 54, 2, 6.
3. BANERJI, A., BARTOLINI, C., BERINGER, D., CHOPELLA, V., ET AL. 2002. Web services conversation language (WSCL) 1.0. W3C Note, http://www.w3.org/TR/2002/NOTE-wscl10-20020314.
4. BELLWOOD, T., CAPELL, S., CLEMENT, L., COLGRAVE, J., ET AL. 2005. UDDI Version 3.0.2. OASIS Standard, http://uddi.org/pubs/uddi-v3.0.2-20041019.htm.
5. BERARDI, D., CALVANESE, D., DE GIACOMO, G., LENZERINI, M., AND MECELLA, M. 2003. Automatic composition of e-services that export their behavior. In Proceedings of the 1st International Conference on Service Oriented Computing (ICSOC), Lecture Notes in Computer Science, vol. 2910, Springer, 43-58.
6. BERNARDI, G., BUGLIESI, M., MACEDONIO, D., AND ROSSI, S. 2008. A theory of adaptable contract-based service composition. In Proceedings of Workshop on Global Computing Models and Technologies (GlobalComp'08). IEEE Computer Society Press.
7. BRAVETTI, M. AND ZAVATTARO, G. 2007. Towards a unifying theory for choreography conformance and contract compliance. In Proceedings of the 6th International Symposium on Software Composition. Springer.
8. BRINKSMA, E., SCOLLO, G., AND STEENBERGEN, C. 1995. Lotos specifications, their implementations and their tests. In Conformance Testing Methodologies and Architectures for OSI Protocols. IEEE Computer Society Press, 468-479.
9. BRUCE, K. AND LONGO, G. 1990. A modest model of records, inheritance and bounded quantification. Inform. Comput. 87, 1/2, 196-240.
10. CARBONE, M., HONDA, K., AND YOSHIDA, N. 2007a. A calculus of global interaction based on session types. Electron. Notes Theor. Comput. Sci. 171, 3, 127-151.
11. CARBONE, M., HONDA, K., AND YOSHIDA, N. 2007b. Structured communication-centred programming for Web services. In Proceedings of the 16th European Symposium on Programming (ESOP'07). Lecture Notes in Computer Science, vol. 4421. Springer.
12. CARDELLI, L. 1988. A semantics of multiple inheritance. Inform. Comput. 76, 138-164.
13. CARPINETI, S., CASTAGNA, G., LANEVE, C., AND PADOVANI, L. 2006. A formal account of contracts for Web Services. In Proceedings of the 3rd International Workshop on Web Services and Formal Methods. Lecture Notes in Computer Science, vol. 4184. Springer.
14. CASTAGNA, G., DEZANI-CIANCAGLINI, M., GIACHINO, E., AND PADOVANI, L. 2008. General session types. Tech. rep. id.: hal-00334435, CNRS - PPS, University Paris 7. http://hal.archives-ouvertes.fr/hal-00334435.
15. CASTAGNA, G. AND FRISCH, A. 2005. A gentle introduction to semantic subtyping. In Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (Summary inICALP'05). (PPDP'05). Lecture Notes in Computer Science, vol. 3580, Springer, 30-34.
16. CASTAGNA, G., GESBERT, N., AND PADOVANI, L. 2007. A theory of contracts for Web services. In Proceedings of the 5th ACM-SIGPLAN Workshop on Programming Language Technologies for XML (PLAN-X'07).
17. CASTAGNA, G., GESBERT, N., AND PADOVANI, L. 2008. A theory of contracts for Web services. In Proceedings of the 35th ACM Symposium on Principles of Programming Languages (POPL'08). 261-272.
18. CHEN, G. 2004. Soundness of coercion in the calculus of constructions. J. Logic Comput. 14, 3, 405-427.
19. CHINNICI, R., HAAS, H., LEWIS, A.-A., MOREAU, J.-J., ORCHARD, D., AND WEERAWARANA, S. 2007a. Web services description language (WSDL) version 2.0 Part 2: Adjuncts. W3C Recommendation, http://www.w3.org/TR/wsdl20-adjuncts/.
20. CHINNICI, R., MOREAU, J.-J., RYMAN, A., AND WEERAWARANA, S. 2007b. Web services description language (WSDL) version 2.0 Part 1: Core language. W3C Recommendation, http://www.w3.org/TR/wsdl20/.
21. COURCELLE, B. 1983. Fundamental properties of infinite trees. Theor. Comput. Sci. 25, 95-169.
22. DE GIACOMO, G. AND SARDIÑA, S. 2007. Automatic synthesis of new behaviors from a library of available behaviors. In Proceedings of the International Joint Conference on Artificial Intelligence. 1866-1871.
23. DE NICOLA, R. AND HENNESSY, M. 1984. Testing equivalences for processes. Theor. Comput. Sci. 34, 83-133.
24. DE NICOLA, R. AND HENNESSY, M. 1987. CCS without τ's. In Procedings of the Colloquium on Trees and Algebra in Programming (TAPSOFT/CAAP'87). Lecture Notes in Computer Science, vol. 249. Springer, 138-152.
25. DE NICOLA, R. AND LABELLA, A. 2003. Nondeterministic regular expressions as solutions of equational systems. Theor. Comput. Sci. 302, 1-3, 179-189.
26. DERRICK, J., BOWMAN, H., BOITEN, E., AND STEEN, M. 1996. Comparing LOTOS and Z refinement relations. In Proceedings of the Joint International Conference on Formal Description Techniques and Protocol Specification Testing and Verification (FORTE/PSTV'96). Chapman & Hall, 501-516.
27. DI COSMO, R. 1995. Isomorphisms of Types: From Lambda Calculus to Information Retrieval and Language Design. Birkhäuser.
28. FALLSIDE, D. C. AND WALMSLEY, P. 2004. XML Schema part 0: Primer second edition. W3C Recommendation, http://www.w3.org/TR/ xmlschema-0/.
29. FOURNET, C. AND GONTHIER, G. 1996. The reflexive chemical abstract machine and the join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages. ACM, 372-385.
30. FOURNET, C., GONTHIER, G., LÉVY, J.-J., MARANGET, L., AND RÉMY, D. 1996. A calculus of mobile agents. In Proceedings of the International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 1119. Springer, 406-421.
31. FOURNET, C., HOARE, C. A. R., RAJAMANI, S. K., AND REHOF, J. 2004. Stuck-free conformance. In Proceedings of the International Conference on Computer-aided Verification (CAV'04). Lecture Notes in Computer Science, vol. 3114. Springer.
32. FRISCH, A., CASTAGNA, G., AND BENZAKEN, V. 2008. Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types. J. ACM 55, 4, 1-64.
33. GAY, S. AND HOLE, M. 2005. Subtyping for session types in the π-calculus. Acta Informatica 42, 2-3, 191-225.
34. HENNESSY, M. 1985. Acceptance trees. J. ACM 32, 4, 896-928.
35. HENNESSY, M. 1988. Algebraic Theory of Processes. Foundation of Computing. MIT Press.
36. HONDA, K. 1993. Types for dyadic interaction. In Proceedings of the International Conference on Concurrency Theory (CONCUR'93). Lecture Notes in Computer Science, vol. 715. Springer, 509-523.
37. HONDA, K., VASCONCELOS, V. T., AND KUBO, M. 1998. Language primitives and type discipline for structured communication-based programming. In proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 1381. Springer.
38. HULL, R., BENEDIKT, M., CHRISTOPHIDES, V., AND SU, J. 2003. E-services: A look behind the curtain. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'03). ACM, New York, 1-14.
39. LANEVE, C. AND PADOVANI, L. 2006. Smooth orchestrators. In Proceedings of the Internatiomal Conference on Foundations of Software Science and Computation Structures, L. Aceto and A. Ingólfsdóttir, Eds. Lecture Notes in Computer Science, vol. 3921. Springer, 32-46.
40. LANEVE, C. AND PADOVANI, L. 2007. The must preorder revisited: An algebraic theory for Web services contracts. In Proceedings of the 18th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 4703, Springer.
41. LANEVE, C. AND PADOVANI, L. 2008. The pairing of contracts and session types. In Proceedings of the Colloquium in Honour of Ugo Montinari. Lecture Notes in Computer Science, vol. 5065. Springer, 681-700.
42. MILNER, R. 1982. A Calculus of Communicating Systems. Springer.
43. PADOVANI, L. 2008. Contract-directed synthesis of simple orchestrators. Proceedings of the 19th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 5201. Springer, 131-146.
44. PISTORE, M., TRAVERSO, P., BERTOLI, P., AND MARCONI, A. 2005. Automated synthesis of composite BPEL4WS Web services. InProceedings ofthe IEEE International Conference on Web Services (ICWS '05). IEEE Computer Society, 293-301.
45. RITTRI, M. 1993. Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theor. Informat. Appl. 27, 6, 523-540.
46. SOLOVIEV, S., JONES, A., AND LUO, Z. 1996. Some algorithmic and proof-theoretical aspects of coercive subtyping. Lecture Notes in Computer Science, vol. 1512, Springer, 173-196.
47. TAKEUCHI, K., HONDA, K., AND KUBO, M. 1994. An interaction-based language and its typing system. In Proceedings of the Parallel Architectures and Languages Europe. 398-413.
48. TRAVERSO, P. AND PISTORE, M. 2004. Automated composition of semantic Web services into executable processes. In Proceedings of the International Semantic Web Conference. 380-394.