An Algebraic Theory for Web Service Contracts

  • Cosimo Laneve
  • Luca Padovani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7940)


We study a natural notion of compliance between clients and services in terms of their BPEL (abstract) descriptions. The induced preorder shows interesting connections with the must preorder and has normal form representatives that are parallel-free finite-state activities, called contracts. The preorder also admits the notion of least service contract that is compliant with a client contract, called principal dual contract. Our framework serves as a foundation of Web service technologies for connecting abstract and concrete service definitions and for service discovery.


Service Discovery Operational Semantic Algebraic Theory Service Contract External Choice 
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.
    Aceto, L., Ingolfsdottir, A., Srba, J.: The algoritmics of bisimilarity. In: Sangiorgi, D., Rutten, J. (eds.) Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, vol. 52, ch.3, pp. 100–172. Cambridge University Press (2011)Google Scholar
  2. 2.
    Alves, A., et al.: Web Services Business Process Execution Language Version 2.0 (January 2007),
  3. 3.
    Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (WSCL) 1.0 (March 2002),
  4. 4.
    Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. SIGPLAN Notices 38(9), 51–63 (2003)CrossRefGoogle Scholar
  5. 5.
    Beringer, D., Kuno, H., Lemon, M.: Using WSCL in a UDDI Registry 1.0. UDDI Working Draft Best Practices Document (2001),
  6. 6.
    Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19(3), 601–638 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Mathematical Structures in Computer Science 19(6), 1191–1222 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Castagna, G., Gesbert, N., Padovani, L.: A Theory of Contracts for Web Services. ACM Transactions on Programming Languages and Systems 31(5) (2009)Google Scholar
  9. 9.
    Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: model checking message-passing programs. SIGPLAN Not. 37(1), 45–57 (2002)CrossRefGoogle Scholar
  10. 10.
    Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language (WSDL) 1.1 (2001),
  11. 11.
    Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. ACM Trans. Program. Lang. Syst. 15(1), 36–72 (1993)CrossRefGoogle Scholar
  12. 12.
    De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)zbMATHCrossRefGoogle Scholar
  13. 13.
    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
  14. 14.
    Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press (1988)Google Scholar
  16. 16.
    Hosoya, H., Pierce, B.C.: XDuce: A statically typed XML processing language. ACM Trans. Internet Techn. 3(2), 117–148 (2003)CrossRefGoogle Scholar
  17. 17.
    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
  18. 18.
    Milner, R.: A Calculus of Communicating Systems. Springer (1982)Google Scholar
  19. 19.
    Nielson, H.R., Nielson, F.: Higher-order concurrent programs with finite communication topology (extended abstract). In: Proceedings of POPL 1994, pp. 84–97. ACM Press (1994)Google Scholar
  20. 20.
    Parastatidis, S., Webber, J.: MEP SSDL Protocol Framework (April 2005),

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Cosimo Laneve
    • 1
  • Luca Padovani
    • 2
  1. 1.INRIA Focus TeamUniversit’a di BolognaItaly
  2. 2.Dipartimento di InformaticaUniversitá di TorinoItaly

Personalised recommendations