|
Formal Methods in Computing (Most of the papers antecedent to 1995 are not included in the list) |
|||
| FRAMES NO FRAME | ||||
| BvBdL15 (In proceedings) | |
| Author(s) | Franco Barbanera, Steffen van Bakel and Ugo de' Liguoro |
| Title | « Orchestrated Session Compliance » |
| In | Proceedings 8th Interaction and Concurrency Experience , Grenoble, France, 4-5th June 2015 |
| Series | Electronic Proceedings in Theoretical Computer Science |
| Editor(s) | Sophia Knight, Ivan Lanese, Alberto Lluch Lafuente and Hugo Torres Vieira |
| Volume | 189 |
| Page(s) | 21-36 |
| Year | 2015 |
| Publisher | Open Publishing Association |
| Abstract | |
| We investigate the notion of orchestrated compliance for client/server interactions in the context of session contracts. Devising the notion of orchestrator in such a context makes it possible to have orchestrators with unbounded buffering capabilities and a t the same time to guarantee any message from the client to be eventually delivered by the orchestrator to the server, while preventing the server from sending messages which are kept indefinitely inside the orchestrator. The compliance relation is shown to be decidable by means of 1) a procedure synthesising the orchestrators, if any, making a client compliant with a server, and 2) a procedure for deciding whether an orchestrator behaves in a proper way as mentioned before. | |
Download the complete article:
| BibTeX code |
@inproceedings{BvBdL15,
volume = {189},
author = {Barbanera, Franco and van Bakel, Steffen and de' Liguoro, Ugo},
series = {Electronic Proceedings in Theoretical Computer Science},
booktitle = {Proceedings 8th Interaction and Concurrency Experience ,
Grenoble, France, 4-5th June 2015},
editor = {Knight, Sophia and Lanese, Ivan and Lluch Lafuente, Alberto and
Torres Vieira, Hugo },
title = {Orchestrated Session Compliance},
abstract = {We investigate the notion of orchestrated compliance for
client/server interactions in the context of session contracts.
Devising the notion of orchestrator in such a context makes it
possible to have orchestrators with unbounded buffering
capabilities and a t the same time to guarantee any message from
the client to be eventually delivered by the orchestrator to the
server, while preventing the server from sending messages which
are kept indefinitely inside the orchestrator. The compliance
relation is shown to be decidable by means of 1) a procedure
synthesising the orchestrators, if any, making a client compliant
with a server, and 2) a procedure for deciding whether an
orchestrator behaves in a proper way as mentioned before.},
tag = {ICE'15},
localfile = {http://arxiv.org/abs/1508.04849},
publisher = {Open Publishing Association},
doi = {10.4204/EPTCS.189.4},
pages = {21-36},
year = {2015},
}
|
Formal Methods in Computing (Most of the papers antecedent to 1995 are 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)
