The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Abstract We study the foundations of Web service technologies for connecting abstract and concrete service definitions and for discovering services according to their observable behavior. We pursue this study addressing a subset of BPEL activities that include concurrency constructs. We present a formal semantics—called compliance preorder —of this subset of BPEL and we define a behavioral type discipline that guarantees the correctness of client-server interactions. The types of our discipline, called contracts , are De Nicola and Hennessy tau-less, finite-state CCS processes. We show that contracts are BPEL normal forms according to the compliance preorder and that the compliance preorder does coincide with a well-known equivalence in concurrency theory, the must-testing preorder . The compliace preorder is not fully adequate for discovering Web services though, since it does not support width and depth extensions of Web services. To address this issue, we propose a sound generalization of the compliance preorder, called subcontract relation , that admits a notion of principal service contract—the dual contract —compliant with a given client contract and that exhibits good precongruence properties when choreographies of Web services are considered.
@article{laneve2015algebraic,
title = {An algebraic theory for web service contracts},
author = {Cosimo Laneve and Luca Padovani},
year = {2015},
journal = {Formal Aspects of Computing},
publisher = {Springer Science+Business Media},
volume = {27},
number = {4},
pages = {613--640},
doi = {10.1007/s00165-015-0334-2},
}