A contract describes the observable behavior of a Web service. When looking for Web services providing specific capabilities, the contract can be used as an important search key. This calls for a notion of contract equivalence that goes beyond nominal or structural equivalence.

In this paper we define a simple, yet expressive formal language for describing Web service contracts. We provide a natural, set-theoretic semantics of contracts and we use it for defining a family of equivalence relations that can be effectively used for discovering and adapting Web services implementing a specific contract.


Induction Hypothesis Composition Operator Operational Semantic Deduction System UDDI Registry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alves, A., Arkin, A., Askary, S., Barreto, C., et al.: Web Services Business Process Execution Language Version 2.0 (2007)Google Scholar
  2. 2.
    Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. J. ACM 54(2), 6 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (wscl) 1.0 (2002)Google Scholar
  4. 4.
    Bellwood, T., Capell, S., Clement, L., Colgrave, J., et al.: uddi Version 3.0.2. OASIS Standard (2005),
  5. 5.
    Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 43–58. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Beringer, D., Kuno, H., Lemon, M.: Using wsclin a uddiRegistry 1.0 (2001)Google Scholar
  7. 7.
    Brinksma, E., Scollo, G., Steenbergen, C.: lotos specifications, their implementations and their tests. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
  8. 8.
    Bruce, K.B., Longo, G.: A modest model of records, inheritance and bounded quantification. Information and Computation 87(1/2), 196–240 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A formal account of contracts for Web Services. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 148–162. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for Web services. In: Proceedings of POPL 2008, pp. 261–272. ACM, New York (2008)Google Scholar
  11. 11.
    Chen, G.: Soundness of coercion in the calculus of constructions. Journal of Logic and Computation 14(3), 405–427 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Chinnici, R., Moreau, J.-J., Ryman, A., Weerawarana, S.: Web Services Description Language (wsdl) Version 2.0 Part 1: Core Language (2007)Google Scholar
  13. 13.
    Colgrave, J., Januszewski, K.: Using wsdl in a uddi registry, version 2.0.2. Technical note, OASIS (2004)Google Scholar
  14. 14.
    Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    De Nicola, R., Hennessy, M.: ccs without τ’s. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol. 249, pp. 138–152. Springer, Heidelberg (1987)Google Scholar
  17. 17.
    De Nicola, R., Labella, A.: Nondeterministic regular expressions as solutions of equational systems. Theor. Comput. Sci. 302(1-3), 179–189 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Eshuis, R., Fokkinga, M.M.: Comparing refinements for failure and bisimulation semantics. Fundamenta Informaticae 52(4), 297–321 (2002)MathSciNetzbMATHGoogle Scholar
  19. 19.
    De Giacomo, G., Sardiña, S.: Automatic synthesis of new behaviors from a library of available behaviors. In: IJCAI, pp. 1866–1871 (2007)Google Scholar
  20. 20.
    Hennessy, M.: Acceptance trees. JACM: Journal of the ACM 32(4), 896–928 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press, Cambridge (1988)zbMATHGoogle Scholar
  22. 22.
    Hull, R., Benedikt, M., Christophides, V., Su, J.: E-services: a look behind the curtain. In: PODS 2003: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 1–14. ACM, New York (2003)Google Scholar
  23. 23.
    Inverardi, P., Tivoli, M.: Software architecture for correct components assembly. In: Bernardo, M., Inverardi, P. (eds.) SFM 2003. LNCS, vol. 2804, pp. 92–121. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  24. 24.
    Laneve, C., Padovani, L.: The must preorder revisited – an algebraic theory for web services contracts. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212–225. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  25. 25.
    Laneve, C., Padovani, L.: The pairing of contracts and session types. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 681–700. Springer, Heidelberg (2008)Google Scholar
  26. 26.
    Misra, J., Cook, W.R.: Computation orchestration – a basis for wide-area computing. Software and Systems Modeling 6(1), 83–110 (2007)CrossRefGoogle Scholar
  27. 27.
    Padovani, L.: Contract-directed synthesis of simple orchestrators. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 131–146. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  28. 28.
    Pistore, M., Traverso, P., Bertoli, P., Marconi, A.: Automated synthesis of composite bpel4ws web services. In: ICWS 2005: Proceedings of the IEEE International Conference on Web Services, Washington, DC, USA, pp. 293–301. IEEE Computer Society, Los Alamitos (2005)Google Scholar
  29. 29.
    Soloviev, S., Jones, A., Luo, Z.: Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping. In: Giménez, E. (ed.) TYPES 1996. LNCS, vol. 1512, pp. 173–196. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  30. 30.
    Traverso, P., Pistore, M.: Automated composition of semantic web services into executable processes. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 380–394. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  31. 31.
    von Riegen, C., Trickovic, I.: Using bpel4ws in a uddi registry. Technical note, OASIS (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Luca Padovani
    • 1
  1. 1.Istituto di Scienze e Tecnologie dell’InformazioneUniversità di UrbinoItaly

Personalised recommendations