The International Joint Conference on theory and practice of software development on TAPSOFT '87
Algebraic theory of processes
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Trace and testing equivalence on asynchronous processes
Information and Computation
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Subtyping for session types in the pi calculus
Acta Informatica
A reuse-based approach to the correct and automatic composition of web-services
International workshop on Engineering of software services for pervasive environments: in conjunction with the 6th ESEC/FSE joint meeting
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
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Global Principal Typing in Partially Commutative Asynchronous Sessions
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Contract-Based Discovery and Adaptation of Web Services
Formal Methods for Web Services
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
| Hi-index | 0.00 |
The availability of repositories of Web service descriptions enables interesting forms of dynamic Web service discovery, such as searching for Web services exposing a specified behavior --- or contract. This calls for a formal notion of contract equivalence satisfying two contrasting goals: being as coarse as possible so as to favor Web services reuse, and guaranteeing smooth client/service interaction. We study an equivalence relation under the assumption that interactions are controlled by orchestrators. We build a simple orchestration language on top of this theory and we show how to synthesize orchestrators out of Web services contracts.