A Reversible Abstract Machine and Its Space Overhead - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

A Reversible Abstract Machine and Its Space Overhead

(1, 2) , (1, 2, 3) , (4) , (5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
978-3-642-30793-5_1_Chapter.pdf (194.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00909384 , version 1 (29-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
405 View
107 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More