Abstract |
Web services are distributed processes exposing a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting forms of dynamic Web service discovery, such as searching for Web services having a specified 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 successful client/service interaction. We study an equivalence relation that achieves both goals under the assumption that client/service interactions may be mediated by simple orchestrators. In the framework we develop, orchestrators play the role of proofs (in the Curry-Howard sense) justifying an equivalence relation between contracts. This makes it possible to automatically synthesize orchestrators out of Web services contracts. |
@article{Padovani10,
volume = {411},
issn = {0304-3975},
author = {Luca Padovani},
url = {http://www.di.unito.it/~padovani/Papers/OrchestratorSynthesisLong.pdf},
abstract = { Web services are distributed processes exposing a public
description of their behavior, or contract. The availability of
repositories of Web service descriptions enables interesting forms
of dynamic Web service discovery, such as searching for Web
services having a specified 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 successful client/service interaction. We study an
equivalence relation that achieves both goals under the assumption
that client/service interactions may be mediated by simple
orchestrators. In the framework we develop, orchestrators play the
role of proofs (in the Curry-Howard sense) justifying an
equivalence relation between contracts. This makes it possible to
automatically synthesize orchestrators out of Web services
contracts. },
title = {{Contract-Based Discovery of Web Services Modulo Simple
Orchestrators}},
publisher = {Elsevier},
year = {2010},
journal = {Theoretical Computer Science},
doi = {10.1016/j.tcs.2010.05.002},
pages = {3328-3347},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)