A Reversible Abstract Machine and Its Space Overhead

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00909384
Contributor : Davide Sangiogi <>
Submitted on : Monday, May 29, 2017 - 4:06:06 PM
Last modification on : Thursday, October 11, 2018 - 8:48:03 AM
Long-term archiving on : Wednesday, September 6, 2017 - 11:28:16 AM

File

978-3-642-30793-5_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Michael Lienhardt, Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani. A Reversible Abstract Machine and Its Space Overhead. 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.1-17, ⟨10.1007/978-3-642-30793-5_1⟩. ⟨hal-00909384⟩

Share

Metrics

Record views

730

Files downloads

121