| BonoPadovani12 (Article)
|
| Author(s) | Viviana Bono and Luca Padovani |
| Title | « Typing Copyless Message Passing » |
| Journal | Logical Methods in Computer Science |
| Volume | 8 |
| Page(s) | 1-50 |
| Year | 2012 |
| ISSN number | 1860-5974 |
| URL | http://arxiv.org/pdf/1202.2086.pdf |
| Abstract |
| We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults, memory leaks, and communication errors. The type system is essentially linear, but we show that linearity alone is inadequate, because it leaves room for scenarios where well-typed processes leak significant amounts of memory. We address these problems basing the type system upon an original variant of session types. |
@article{BonoPadovani12,
volume = {8},
issn = {1860-5974},
author = {Viviana Bono and Luca Padovani},
issue = {1:17},
url = {http://arxiv.org/pdf/1202.2086.pdf},
abstract = { We present a calculus that models a form of process interaction
based on copyless message passing, in the style of Singularity OS.
The calculus is equipped with a type system ensuring that
well-typed processes are free from memory faults, memory leaks,
and communication errors. The type system is essentially linear,
but we show that linearity alone is inadequate, because it leaves
room for scenarios where well-typed processes leak significant
amounts of memory. We address these problems basing the type
system upon an original variant of session types. },
title = {{Typing Copyless Message Passing}},
doi = {10.2168/LMCS-8(1:17)2012},
journal = {Logical Methods in Computer Science},
year = {2012},
pages = {1-50},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
