TY  - CHAP
T2  - CONCUR 2011 ? Concurrency Theory
Y1  - 2011///
A1  - Lanese, Ivan
A1  - Mezzina, Claudio Antares
A1  - Schmitt, Alan
A1  - Stefani, Jean-Bernard
UR  - http://dx.doi.org/10.1007/978-3-642-23217-6_20
PB  - Springer
EP  - 311
ID  - eprints2489
T3  - Lecture Notes in Computer Science
N2  - We present in this paper a fine-grained rollback primitive for the higher-order ?-calculus (HO?), that builds on the reversibility apparatus of reversible HO? [9]. The definition of a proper semantics for such a primitive is a surprisingly delicate matter because of the potential interferences between concurrent rollbacks. We define in this paper a high-level operational semantics which we prove sound and complete with respect to reversible HO? backward reduction. We also define a lower-level distributed semantics, which is closer to an actual implementation of the rollback primitive, and we prove it to be fully abstract with respect to the high-level semantics.
SP  - 297
TI  - Controlling reversibility in higher-order pi
AV  - none
N1  - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Pages
SN  - 978-3-642-23217-6
ER  -