Contract-Directed Synthesis of Simple Orchestrators

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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.
    Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (WSCL) 1.0 (2002)Google Scholar
  3. 3.
    Beringer, D., Kuno, H., Lemon, M.: Using WSCL in a UDDI Registry 1.0 (2001)Google Scholar
  4. 4.
    Boreale, M., Nicola, R.D., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation 172(2), 139–164 (2002)MATHCrossRefMathSciNetGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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. 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. 9.
    Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5(1), 1–20 (1993)MATHCrossRefGoogle Scholar
  10. 10.
    Colgrave, J., Januszewski, K.: Using WSDL in a UDDI registry, version 2.0.2. Technical note, OASIS (2004)Google Scholar
  11. 11.
    De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)MATHCrossRefMathSciNetGoogle Scholar
  12. 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. 13.
    Di Cosmo, R.: Isomorphisms of Types: from Lambda Calculus to Information Retrieval and Language Design. Birkhäuser, Basel (1995)MATHGoogle Scholar
  14. 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. 15.
    Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Hennessy, M.: Algebraic Theory of Processes. In: Foundation of Computing. MIT Press, Cambridge (1988)Google Scholar
  17. 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. 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. 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. 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)MATHCrossRefMathSciNetGoogle Scholar
  21. 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)CrossRefGoogle Scholar
  22. 22.
    Misra, J., Cook, W.R.: Computation orchestration – a basis for wide-area computing. Software and Systems Modeling 6(1), 83–110 (2007)CrossRefGoogle Scholar
  23. 23.
    Padovani, L.: Contract-directed synthesis of simple orchestrators. Technical report (2008), http://www.sti.uniurb.it/padovani/Papers/OrchestratorSynthesis.pdf
  24. 24.
    Rittri, M.: Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications 27(6), 523–540 (1993)MATHGoogle Scholar
  25. 25.
    von Riegen, C., Trickovic, I.: Using bpel4ws in a UDDI registry. Technical note, OASIS (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Luca Padovani
    • 1
  1. 1.Information Science and Technology InstituteUniversity of Urbino 

Personalised recommendations