Journal of the ACM (JACM)
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Algebraic theory of processes
A modest model of records, inheritance, and unbounded quantification
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtyping
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Nondeterministic regular expressions as solutions of equational systems
Theoretical Computer Science
Automated Synthesis of Composite BPEL4WS Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Soundness of Coercion in the Calculus of Constructions
Journal of Logic and Computation
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
The Pairing of Contracts and Session Types
Concurrency, Graphs and Models
Contract-Directed Synthesis of Simple Orchestrators
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Automatic synthesis of new behaviors from a library of available behaviors
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
A contract describes the observable behavior of a Web service. When looking for Web services providing specific capabilities, the contract can be used as an important search key. This calls for a notion of contract equivalence that goes beyond nominal or structural equivalence. In this paper we define a simple, yet expressive formal language for describing Web service contracts. We provide a natural, set-theoretic semantics of contracts and we use it for defining a family of equivalence relations that can be effectively used for discovering and adapting Web services implementing a specific contract.