Abstract
We define a formal contract language along with subcontract and compliance relations. We then extrapolate contracts out of processes, that are a recursion-free fragment of ccs. We finally demonstrate that a client completes its interactions with a service provided the corresponding contracts comply. Our contract language may be used as a foundation of Web services technologies, such as wsdl and wscl.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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
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
Booth, D., Liu, C.K.: Web Services Description Language (WSDL) Version 2.0 Part 0: Primer (March 2006)
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
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
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
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
Cosmo, R.D.: Isomorphisms of Types: from Lambda Calculus to Information Retrieval and Language Desig. Birkhauser, Basel (1995)
Fallside, D.C., Walmsley, P.: XML Schema Part 0: Primer Second Edition (October 2004), http://www.w3.org/TR/xmlschema-0/
Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-free conformance. Technical Report MSR-TR-2004-69, Microsoft Research (July 2004)
Hennessy, M.: Acceptance trees. JACM: Journal of the ACM 32(4), 896–928 (1985)
Hennessy, M.C.B.: Algebraic Theory of Processes. In: Foundation of Computing, MIT Press, Cambridge (1988)
Milner, R.: A Calculus of Communicating Systems. Springer, New York (1982)
Nicola, R.D., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)
Nicola, R.D., Hennessy, M.: CCS without tau’s. In: TAPSOFT 1987/CAAP 1987: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming, vol. 1, pp. 138–152. Springer, Heidelberg (1987)
Phillips, I.: Refusal testing. Theor. Comput. Sci. 50(3), 241–284 (1987)
Queinnec, C.: Inverting back the inversion of control or, continuations versus page-centric programming. SIGPLAN Not. 38(2), 57–64 (2003)
Rittri, M.: Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications 27(6), 523–540 (1993)
Savas Parastatidis and Jim Webber. MEP SSDL Protocol Framework (April 2005), http://ssdl.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carpineti, S., Castagna, G., Laneve, C., Padovani, L. (2006). A Formal Account of Contracts for Web Services. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds) Web Services and Formal Methods. WS-FM 2006. Lecture Notes in Computer Science, vol 4184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841197_10
Download citation
DOI: https://doi.org/10.1007/11841197_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38862-3
Online ISBN: 978-3-540-38865-4
eBook Packages: Computer ScienceComputer Science (R0)