A reversible abstract machine and its space overhead

Authors:
Michael Lienhardt;Ivan Lanese;Claudio Antares Mezzina;Jean-Bernard Stefani
Affiliations:
Focus Team, University of Bologna/INRIA, Italy;Focus Team, University of Bologna/INRIA, Italy;SOA Unit, FBK, Trento, Italy;INRIA Grenoble-Rhône-Alpes, France
Venue:
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2012

Citing 18
Cited 1

A formal approach to undo operations in programming languages

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Notes on the history of reversible computation

IBM Journal of Research and Development
Reversible, irreversible and optimal &lgr;-machines

Theoretical Computer Science - Special issue on linear logic, 1
Time and Space Bounds for Reversible Simulation

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Concepts, Techniques, and Models of Computer Programming

Concepts, Techniques, and Models of Computer Programming
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to reversible computing: motivation, progress, and challenges

Proceedings of the 2nd conference on Computing frontiers
Time, space, and energy in reversible computing

Proceedings of the 2nd conference on Computing frontiers
A Functional Quantum Programming Language

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
AtomCaml: first-class atomicity via rollback

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A reversible programming language and its invertible self-interpreter

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Undo for operators: building an undoable e-mail store

ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications
Reversible Computation and Reversible Programming Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Reversing higher-order pi

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Clean translation of an imperative reversible programming language

CC'11/ETAPS'11 Proceedings of the 20th international conference on Compiler construction: part of the joint European conferences on theory and practice of software
Controlling reversibility in higher-order Pi

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Reversible machine code and its abstract processor architecture

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Concurrent flexible reversibility

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.