Article

The must preorder revisited: an algebraic theory for web services contracts

Authors:

Luca PadovaniAuthors Info & Claims

CONCUR'07: Proceedings of the 18th international conference on Concurrency Theory

Pages 212 - 225

Published: 03 September 2007 Publication History

Abstract

We define a language for Web services contracts as a parallelfree 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.

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)

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

[8]

Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: model checking messagepassing programs. SIGPLAN Not. 37(1), 45-57 (2002)

Digital Library

[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.: UsingWSDL 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-w sdl-v2.htm

[13]

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

Digital Library

[14]

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

Digital Library

[15]

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

Digital Library

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

Digital Library

[18]

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

[19]

Nicola, R.D., Hennessy, M.: CCS without t 's. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol. 249, pp. 138-152. Springer, Heidelberg (1987)

Digital Library

[20]

Nielson, H.R., Nielson, F.: Higher-order concurrent programs with finite communication topology (extended abstract). In: POPL '94. Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 84-

Digital Library

[21]

ACM Press, New York, NY, USA (1994)

[22]

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

Cited By

Castagna GGesbert NPadovani L(2008)A theory of contracts for web servicesACM SIGPLAN Notices10.1145/1328897.132847143:1(261-272)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328897.1328471
Castagna GGesbert NPadovani LNecula GWadler P(2008)A theory of contracts for web servicesProceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1328438.1328471(261-272)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328438.1328471

Recommendations

The Must Preorder Revisited
CONCUR '07: Proceedings of the 18th international conference on Concurrency Theory

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 ...
Service matchmaking revisited: An approach based on model checking

The aim of service discovery is to find services that satisfy user requests in a precise and effective manner. An important aspect of service discovery is service matchmaking, which constitutes the mechanism to map appropriate services to requests. ...
Simulation Preorder on Simple Process Algebras
ICAL '99: Proceedings of the 26th International Colloquium on Automata, Languages and Programming

We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CONCUR'07: Proceedings of the 18th international conference on Concurrency Theory

September 2007

506 pages

ISBN:3540744061

Editors:
Luís Caires
Universidade Nova de Lisboa, Portugal
,
Vasco T. Vasconcelos
Universidade de Lisboa, Portugal

Sponsors

Centro de Informática e Tecnologias da Informação/FCT/UNL: Centro de Informática e Tecnologias da Informação/FCT/UNL
Fundação para a Ciência e Tecnologia, Ministério da Ciência e Ensino Superior: Fundação para a Ciência e Tecnologia, Ministério da Ciência e Ensino Superior
Security and Quantum Information Group/Instituto de Telecomunicações: Security and Quantum Information Group/Instituto de Telecomunicações
Camara Municipal de Lisboa

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 September 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Castagna GGesbert NPadovani L(2008)A theory of contracts for web servicesACM SIGPLAN Notices10.1145/1328897.132847143:1(261-272)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328897.1328471
Castagna GGesbert NPadovani LNecula GWadler P(2008)A theory of contracts for web servicesProceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1328438.1328471(261-272)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328438.1328471

View Options

View options

Media

Figures

Other

Tables

View Table of Contents