<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>9302</REFNUM><AUTHORS><AUTHOR>Castagna,G.</AUTHOR><AUTHOR>Gesbert,N.</AUTHOR><AUTHOR>Padovani,L.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>A Theory of Contracs for Web Services</TITLE><PLACE_PUBLISHED>POPL'08, 35th ACM symposium on Principles of programming languages, San Francisco</PLACE_PUBLISHED><PUBLISHER>ACM</PUBLISHER><PAGES>261-272</PAGES><ISBN>978-1-59593-689-9</ISBN><LABEL>Castagna:2008:9302</LABEL><KEYWORDS><KEYWORD>Web services</KEYWORD></KEYWORDS<ABSTRACT>Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a service with another service. The use of contracts statically ensures the successful completion of every possible interaction between compatible clients and services. The technical device that underlies the theory is the definition of filters, which are explicit coercions that prevent some possible behaviours of services and, in doing so, they make services compatible with different usage scenarios. We show that filters can be seen as proofs of a sound and complete subcontracting deduction system which simultaneously refines and extends Hennessy’s classical axiomatisation of the must testing preorder. The relation is decidable and the decision algorithm is obtained via a cut-elimination process that proves the coherence of subcontracting as a logical system. Despite the richness of the technical development, the resulting approach is based on simple ideas and basic intuitions. Remarkably, its application is mostly independent of the language used to program the services or the clients. We also outline the possible practical impact of such a work and the perspectives of future research it opens.</ABSTRACT><NOTES>Extended and superseded by a new article in TOPLAS, june 2009</NOTES><URL>http://dx.doi.org/10.1145/1328438.1328471</URL></RECORD></RECORDS></XML>