eprintid: 2489
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/24/89
datestamp: 2015-01-15 13:12:28
lastmod: 2015-01-15 13:12:28
status_changed: 2015-01-15 13:12:28
type: book_section
metadata_visibility: show
creators_name: Lanese, Ivan
creators_name: Mezzina, Claudio Antares
creators_name: Schmitt, Alan
creators_name: Stefani, Jean-Bernard
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
creators_id: 
creators_id: 
title: Controlling reversibility in higher-order pi
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings
Pages
abstract: 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.
date: 2011
series: Lecture Notes in Computer Science
number: 6901
publisher: Springer
pagerange: 297-311
id_number: 10.1007/978-3-642-23217-6_20
refereed: TRUE
isbn: 978-3-642-23217-6
book_title: CONCUR 2011 – Concurrency Theory
official_url: http://dx.doi.org/10.1007/978-3-642-23217-6_20
projects: Partly funded by the EU project FP7-231620 HATS, the ANR-2010-SEGI-013 project AEOLUS, and the ANR-2010-BLAN-0305-01 project PiCoq
citation:   Lanese, Ivan and Mezzina, Claudio Antares and Schmitt, Alan and Stefani, Jean-Bernard  Controlling reversibility in higher-order pi.   In:  CONCUR 2011 – Concurrency Theory.   Lecture Notes in Computer Science  (6901).  Springer, pp. 297-311.  ISBN 978-3-642-23217-6      (2011)