eprintid: 2500
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/25/00
datestamp: 2015-01-16 09:54:20
lastmod: 2015-01-16 09:54:20
status_changed: 2015-01-16 09:54:20
type: article
metadata_visibility: show
creators_name: Lanese, Ivan
creators_name: Mezzina, Claudio Antares
creators_name: Tiezzi, Francesco
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
creators_id: francesco.tiezzi@imtlucca.it
title: Causal-consistent reversibility
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: Reversible computing allows one to execute programs both in the standard,
forward direction, and backward, going back to past states. In a concurrent
scenario, the correct notion of reversibility is causal-consistent reversibility:
any action can be undone, provided that all its consequences (if
any) are undone beforehand. In this paper we present an overview of the
main approaches, results, and applications of causal-consistent reversibility.
date: 2014-10
date_type: published
publication: Bulletin of EATCS
volume: 114
publisher: European association for theorical computer science
pagerange: 1-19
refereed: TRUE
official_url: http://eatcs.org/beatcs/index.php/beatcs/article/view/305/287
projects: This work has been partially supported by the MIUR PRIN project CINA n. 2010LHT4KM
citation:   Lanese, Ivan and Mezzina, Claudio Antares and Tiezzi, Francesco  Causal-consistent reversibility.  Bulletin of EATCS, 114.  pp. 1-19.       (2014)