%T A reversible abstract machine and its space overhead
%R 10.1007/978-3-642-30793-5_1
%P 1-17
%S Lecture Notes in Computer Science
%O 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
%B Formal Techniques for Distributed Systems
%N 7273
%L eprints2491
%X 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 Springer
%A Michael Lienhardt
%A Ivan Lanese
%A Claudio Antares Mezzina
%A Jean-Bernard Stefani
%D 2012