Skip to main content
SpringerLink
Log in

Contract-Directed Synthesis of Simple Orchestrators

  • Conference paper
CONCUR 2008 - Concurrency Theory (CONCUR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5201))

Included in the following conference series:

Abstract

The availability of repositories of Web service descriptions enables interesting forms of dynamic Web service discovery, such as searching for Web services exposing a specified behavior – or contract. This calls for a formal notion of contract equivalence satisfying two contrasting goals: being as coarse as possible so as to favor Web services reuse, and guaranteeing smooth client/service interaction. We study an equivalence relation under the assumption that interactions are controlled by orchestrators. We build a simple orchestration language on top of this theory and we show how to synthesize orchestrators out of Web services contracts.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Alves, A., Arkin, A., Askary, S., Barreto, C., et al.: Web Services Business Process Execution Language Version 2.0 (2007)

    Google Scholar 

  2. Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (WSCL) 1.0 (2002)

    Google Scholar 

  3. Beringer, D., Kuno, H., Lemon, M.: Using WSCL in a UDDI Registry 1.0 (2001)

    Google Scholar 

  4. Boreale, M., Nicola, R.D., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation 172(2), 139–164 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 90–101. Springer, Heidelberg (1998)

    Google Scholar 

  8. Chinnici, R., Moreau, J.-J., Ryman, A., Weerawarana, S.: Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language (2007)

    Google Scholar 

  9. Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5(1), 1–20 (1993)

    Article  MATH  Google Scholar 

  10. Colgrave, J., Januszewski, K.: Using WSDL in a UDDI registry, version 2.0.2. Technical note, OASIS (2004)

    Google Scholar 

  11. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  12. 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 

  13. Di Cosmo, R.: Isomorphisms of Types: from Lambda Calculus to Information Retrieval and Language Design. Birkhäuser, Basel (1995)

    MATH  Google Scholar 

  14. Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-free conformance. Technical Report MSR-TR-2004-69, Microsoft Research (2004)

    Google Scholar 

  15. Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  17. Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509–523. Springer, Heidelberg (1993)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Inverardi, P., Tivoli, M.: A reuse-based approach to the correct and automatic composition of web-services. In: ESSPE 2007, pp. 29–33 (2007)

    Google Scholar 

  20. Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1), 43–68 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  21. 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 

  22. Misra, J., Cook, W.R.: Computation orchestration – a basis for wide-area computing. Software and Systems Modeling 6(1), 83–110 (2007)

    Article  Google Scholar 

  23. Padovani, L.: Contract-directed synthesis of simple orchestrators. Technical report (2008), http://www.sti.uniurb.it/padovani/Papers/OrchestratorSynthesis.pdf

  24. Rittri, M.: Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications 27(6), 523–540 (1993)

    MATH  Google Scholar 

  25. von Riegen, C., Trickovic, I.: Using bpel4ws in a UDDI registry. Technical note, OASIS (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Science and Technology Institute, University of Urbino,  

    Luca Padovani

Authors
  1. Luca Padovani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franck van Breugel Marsha Chechik

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Padovani, L. (2008). Contract-Directed Synthesis of Simple Orchestrators. In: van Breugel, F., Chechik, M. (eds) CONCUR 2008 - Concurrency Theory. CONCUR 2008. Lecture Notes in Computer Science, vol 5201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85361-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85361-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85360-2

  • Online ISBN: 978-3-540-85361-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation