Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

 LanevePadovani07 (In proceedings) Author(s) Cosimo Laneve and Luca Padovani Title « The Must Preorder Revisited - An Algebraic Theory for Web Services Contracts » In Proceedings of the International Conference on Concurrency Theory (CONCUR'07) Series LNCS Volume 4703 Page(s) 212-225 Year 2007 Publisher Springer URL http://www.di.unito.it/~padovani/Papers/lncs_4703.pdf
 Abstract We define a language for Web services contracts as a parallel-free fragment of CCS and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must preorder, and it exhibits good precongruence properties when choreographies of Web services are considered. Our contract language may be used as a foundation of Web services technologies, such as WSDL and WSCL.

 BibTeX code

@inproceedings{LanevePadovani07,
volume = {4703},
author = {Cosimo Laneve and Luca Padovani},
series = {LNCS},
booktitle = {Proceedings of the International Conference on Concurrency Theory
(CONCUR'07)},
abstract = { We define a language for Web services contracts as a
parallel-free fragment of \textsc{ccs} and we study a natural
notion of compliance between clients and services in terms of
their corresponding contracts. The induced contract preorder turns
out to be valuable in searching and querying registries of Web
services, it shows interesting connections with the must preorder,
and it exhibits good precongruence properties when choreographies
of Web services are considered. Our contract language may be used
as a foundation of Web services technologies, such as
\textsc{wsdl} and \textsc{wscl}. },
title = {{The \emph{Must} Preorder Revisited - An Algebraic Theory for Web
Services Contracts}},
publisher = {Springer},
year = {2007},
pages = {212-225},
doi = {10.1007/978-3-540-74407-8\_15},
}

 Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)