| CastagnaPadovani09 (In proceedings)
|
| Author(s) | Giuseppe Castagna and Luca Padovani |
| Title | « Contracts for Mobile Processes » |
| In | Proceedings of the International Conference on Concurrency Theory (CONCUR'09) |
| Series | LNCS |
| Volume | 5710 |
| Page(s) | 211-228 |
| Year | 2009 |
| Publisher | Springer |
| URL | http://www.di.unito.it/~padovani/Papers/lncs_5710.pdf |
| Abstract |
| Theories identifying well-formed systems of processes -- those that lack communication errors and enjoy strong properties such as deadlock freedom -- are based either on session types, which are inhabited by channels, or on contracts, which are inhabited by processes. Current session type theories impose overly restrictive disciplines while contract theories only work for networks with fixed topology. Here we fill the gap between the two approaches by defining a theory of contracts for so-called mobile processes, those whose communications may include delegations and channel references. |
@inproceedings{CastagnaPadovani09,
volume = {5710},
author = {Giuseppe Castagna and Luca Padovani},
series = {LNCS},
booktitle = {Proceedings of the International Conference on Concurrency Theory
(CONCUR'09)},
url = {http://www.di.unito.it/~padovani/Papers/lncs_5710.pdf},
abstract = { Theories identifying well-formed systems of processes -- those
that lack communication errors and enjoy strong properties such as
deadlock freedom -- are based either on session types, which are
inhabited by channels, or on contracts, which are inhabited by
processes. Current session type theories impose overly restrictive
disciplines while contract theories only work for networks with
fixed topology. Here we fill the gap between the two approaches by
defining a theory of contracts for so-called mobile processes,
those whose communications may include delegations and channel
references. },
title = {{Contracts for Mobile Processes}},
publisher = {Springer},
year = {2009},
pages = {211-228},
doi = {10.1007/978-3-642-04081-8\_15},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
