%0 Book Section
%A Lanese, Ivan
%A Mezzina, Claudio Antares
%A Schmitt, Alan
%A Stefani, Jean-Bernard
%B CONCUR 2011 – Concurrency Theory
%D 2011
%F eprints:2489
%I Springer
%N 6901
%P 297-311
%S Lecture Notes in Computer Science
%T Controlling reversibility in higher-order pi
%U http://eprints.imtlucca.it/2489/
%X 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.
%Z 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings  Pages