@incollection{eprints2489,
            year = {2011},
           title = {Controlling reversibility in higher-order pi},
          series = {Lecture Notes in Computer Science},
          number = {6901},
           pages = {297--311},
       booktitle = {CONCUR 2011 ? Concurrency Theory},
          author = {Ivan Lanese and Claudio Antares Mezzina and Alan Schmitt and Jean-Bernard Stefani},
       publisher = {Springer},
            note = {22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Pages},
             url = {http://eprints.imtlucca.it/2489/},
        abstract = {We present in this paper a fine-grained rollback primitive for the higher-order {\ensuremath{\pi}}-calculus (HO{\ensuremath{\pi}}), that builds on the reversibility apparatus of reversible HO{\ensuremath{\pi}} [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{\ensuremath{\pi}} 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.}
}