The Must Preorder Revisited

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


We define a language for Web services contracts as a parallel-free fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must preorder, and it exhibits good precongruence properties when choreographies of Web services are considered. Our contract language may be used as a foundation of Web services technologies, such as wsdl and wscl.


Service Contract Behavioral Compliance UDDI Registry External Choice Internal 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.
    Alves, A., Arkin, A., Askary, S., Barreto, C., Bloch, B., Curbera, F., Ford, M., Goland, Y., Guízar, A., Kartha, N., Liu, C.K., Khalaf, R., König, D., Marin, M., Mehta, V., Thatte, S., van der Rijn, D., Yendluri, P., Yiu, A.: Web Services Business Process Execution Language Version 2.0 (January 2007),
  2. 2.
    Banerji, A., Bartolini, C., Beringer, D., Chopella, V., et al.: Web Services Conversation Language (WSCL) 1.0 (March 2002),
  3. 3.
    Beringer, D., Kuno, H., Lemon, M.: Using WSCL in a UDDI Registry 1.0, UDDI Working Draft Best Practices Document (2001),
  4. 4.
    Bravetti, M., Zavattaro, G.: Towards a unifying theory for choreography conformance and contract compliance. In: Pre-proceedings of 6th Symposium on Software Composition (2007)Google Scholar
  5. 5.
    Carbone, M., Honda, K., Yoshida, N.: Structured communication-centered programming for web services. In: Proceedings of 16th European Symposium on Programming. LNCS, Springer, Heidelberg (2007)Google Scholar
  6. 6.
    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
  7. 7.
    Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for Web Services. In: Proceedings of 5th ACM SIGPLAN Workshop on Programming Language Technologies for XML, pp. 37–48. ACM Press, New York (2007)Google Scholar
  8. 8.
    Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: model checking message-passing programs. SIGPLAN Not. 37(1), 45–57 (2002)CrossRefGoogle Scholar
  9. 9.
    Chinnici, R., Haas, H., Lewis, A.A., Moreau, J.-J., et al.: Web Services Description Language (WSDL) Version 2.0 Part 2: Adjuncts (March 2006),
  10. 10.
    Chinnici, R., Moreau, J.-J., Ryman, A., Weerawarana, S.: Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language (March 2006),
  11. 11.
    Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web Services Description Language (WSDL) 1.1 (2001),
  12. 12.
    Colgrave, J., Januszewski, K.: Using WSDL in a UDDI registry, version 2.0.2. Technical note, OASIS (2004),
  13. 13.
    Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Hennessy, M.: Acceptance trees. JACM: Journal of the ACM 32(4), 896–928 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hennessy, M.C.B.: Algebraic Theory of Processes. Foundation of Computing, MIT Press, Cambridge (1988)Google Scholar
  16. 16.
    Kavantzas, N., Burdett, D., Ritzinger, G., Fletcher, T., Lafon, Y., Barreto, C.: Web Services Choreography Description Language 1.0 (2005),
  17. 17.
    Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1982)Google Scholar
  18. 18.
    Nicola, R.D., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci 34, 83–133 (1984)zbMATHCrossRefGoogle Scholar
  19. 19.
    Nicola, R.D., Hennessy, M.: CCS without τ’s. In: Ehrig, H., Levi, G., Montanari, U. (eds.) TAPSOFT 1987/CAAP 1987: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming, pp. 138–152. Springer, Heidelberg (1987)Google Scholar
  20. 20.
    Nielson, H.R., Nielson, F.: Higher-order concurrent programs with finite communication topology (extended abstract). In: POPL 1994. Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 84–97. ACM Press, New York (1994)CrossRefGoogle Scholar
  21. 21.
    Parastatidis, S., Webber, J.: MEP SSDL Protocol Framework (April 2005),

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Cosimo Laneve
    • 1
  • Luca Padovani
    • 2
  1. 1.Department of Computer Science, University of Bologna 
  2. 2.Information Science and Technology Institute, University of Urbino 

Personalised recommendations