Skip to main content
Springer Nature Link
Log in

An Algebraic Theory for Web Service Contracts

  • Conference paper
Integrated Formal Methods (IFM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7940))

Included in the following conference series:

  • 862 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. Alves, A., et al.: Web Services Business Process Execution Language Version 2.0 (January 2007), http://docs.oasis-open.org/wsbpel/2.0/CS01/wsbpel-v2.0-CS01.html

  3. Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (WSCL) 1.0 (March 2002), http://www.w3.org/TR/2002/NOTE-wscl10-20020314

  4. Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. SIGPLAN Notices 38(9), 51–63 (2003)

    Article  Google Scholar 

  5. Beringer, D., Kuno, H., Lemon, M.: Using WSCL in a UDDI Registry 1.0. UDDI Working Draft Best Practices Document (2001), http://xml.coverpages.org/HP-UDDI-wscl-5-16-01.pdf

  6. Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19(3), 601–638 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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. Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: model checking message-passing programs. SIGPLAN Not. 37(1), 45–57 (2002)

    Article  Google Scholar 

  10. Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language (WSDL) 1.1 (2001), http://www.w3.org/TR/2001/NOTE-wsdl-20010315

  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)

    Article  Google Scholar 

  12. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)

    Article  MATH  Google Scholar 

  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. Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)

    Article  MathSciNet  Google Scholar 

  15. Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press (1988)

    Google Scholar 

  16. Hosoya, H., Pierce, B.C.: XDuce: A statically typed XML processing language. ACM Trans. Internet Techn. 3(2), 117–148 (2003)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  18. Milner, R.: A Calculus of Communicating Systems. Springer (1982)

    Google Scholar 

  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. Parastatidis, S., Webber, J.: MEP SSDL Protocol Framework (April 2005), http://ssdl.org

Download references

Author information

Authors and Affiliations

  1. INRIA Focus Team, Universit’a di Bologna, Italy

    Cosimo Laneve

  2. Dipartimento di Informatica, Universitá di Torino, Italy

    Luca Padovani

Authors
  1. Cosimo Laneve
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Padovani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Oslo, P.O. Box 1080, 0316, Oslo, Norway

    Einar Broch Johnsen

  2. Department of Information Technologies, Åbo Akademi University, Joukahaisenkatu 3-5A, 20520, Turku, Finland

    Luigia Petre

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laneve, C., Padovani, L. (2013). An Algebraic Theory for Web Service Contracts. In: Johnsen, E.B., Petre, L. (eds) Integrated Formal Methods. IFM 2013. Lecture Notes in Computer Science, vol 7940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38613-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38613-8_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38612-1

  • Online ISBN: 978-3-642-38613-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics