iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://link.springer.com/doi/10.1007/978-3-540-74407-8_15
The Must Preorder Revisited | SpringerLink
Skip to main content
Springer Nature Link
Log in

The Must Preorder Revisited

  • Conference paper
CONCUR 2007 – Concurrency Theory (CONCUR 2007)

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

Included in the following conference series:

Abstract

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.

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

Similar content being viewed by others

References

  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), http://docs.oasis-open.org/wsbpel/2.0/CS01/wsbpel-v2.0-CS01.html

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

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

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

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

  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), http://www.w3.org/TR/2006/CR-wsdl20-adjuncts-20060327

  10. Chinnici, R., Moreau, J.-J., Ryman, A., Weerawarana, S.: Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language (March 2006), http://www.w3.org/TR/2006/CR-wsdl20-20060327

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

  12. Colgrave, J., Januszewski, K.: Using WSDL in a UDDI registry, version 2.0.2. Technical note, OASIS (2004), http://www.oasis-open.org/committees/uddi-spec/doc/tn/uddi-spec-tc-tn-wsdl-v2.htm

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Hennessy, M.: Acceptance trees. JACM: Journal of the ACM 32(4), 896–928 (1985)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. Kavantzas, N., Burdett, D., Ritzinger, G., Fletcher, T., Lafon, Y., Barreto, C.: Web Services Choreography Description Language 1.0 (2005), http://www.w3.org/TR/2005/CR-ws-cdl-10-20051109/

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  21. Parastatidis, S., Webber, J.: MEP SSDL Protocol Framework (April 2005), http://ssdl.org

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bologna,  

    Cosimo Laneve

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

    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

Luís Caires Vasco T. Vasconcelos

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laneve, C., Padovani, L. (2007). The Must Preorder Revisited. In: Caires, L., Vasconcelos, V.T. (eds) CONCUR 2007 – Concurrency Theory. CONCUR 2007. Lecture Notes in Computer Science, vol 4703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74407-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74407-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74406-1

  • Online ISBN: 978-3-540-74407-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation