eprintid: 2491
rev_number: 7
eprint_status: archive
userid: 6
dir: disk0/00/00/24/91
datestamp: 2015-01-15 13:24:00
lastmod: 2015-01-15 13:24:00
status_changed: 2015-01-15 13:24:00
type: book_section
metadata_visibility: show
creators_name: Lienhardt, Michael
creators_name: Lanese, Ivan
creators_name: Mezzina, Claudio Antares
creators_name: Stefani, Jean-Bernard
creators_id: 
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
creators_id: 
title: A reversible abstract machine and its space overhead
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: Joint 14th IFIP WG 6.1 International Conference, FMOODS 2012 and 32nd IFIP WG 6.1 International Conference, FORTE 2012, Stockholm, Sweden, June 13-16, 2012. Proceedings
abstract: We study in this paper the cost of making a concurrent programming language reversible. More specifically, we take an abstract machine for a fragment of the Oz programming language and make it reversible. We show that the overhead of the reversible machine with respect to the original one in terms of space is at most linear in the number of execution steps. We also show that this bound is tight since some programs cannot be made reversible without storing a commensurate amount of information.
date: 2012
date_type: published
series: Lecture Notes in Computer Science
number: 7273
publisher: Springer
pagerange: 1-17
id_number: 10.1007/978-3-642-30793-5_1
refereed: TRUE
isbn: 978-3-642-30793-5
book_title: Formal Techniques for Distributed Systems
official_url: http://link.springer.com/chapter/10.1007/978-3-642-30793-5_1#
projects: This work has been partially supported by the French National Research Agency (ANR), project REVER n. ANR 11 INSE 007
citation:   Lienhardt, Michael and Lanese, Ivan and Mezzina, Claudio Antares and Stefani, Jean-Bernard  A reversible abstract machine and its space overhead.   In:  Formal Techniques for Distributed Systems.   Lecture Notes in Computer Science  (7273).  Springer, pp. 1-17.  ISBN 978-3-642-30793-5      (2012)