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.
M. Lienhardt, I. Lanese, C. A. Mezzina, J.-B. Stefani (2012). A Reversible Abstract Machine and Its Space Overhead. BERLIN : Springer [10.1007/978-3-642-30793-5_1].
A Reversible Abstract Machine and Its Space Overhead
LIENHARDT, MICHAEL;LANESE, IVAN;
2012
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
