%0 Conference Proceedings
%T A Reversible Abstract Machine and Its Space Overhead
%+ Foundations of Component-based Ubiquitous Systems (FOCUS)
%+ Department of Computer Science and Engineering [Bologna] (DISI)
%+ Dipartimento di Scienze dell'Informazione [Bologna] (DISI)
%+ Service Oriented Applications Research Unit [Trento] (SOA)
%+ System architecture for reflective distributed computing environments (SARDES)
%A Lienhardt, Michael
%A Lanese, Ivan
%A Mezzina, Claudio Antares
%A Stefani, Jean-Bernard
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 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)
%C Stockholm, Sweden
%Y Holger Giese
%Y Grigore Rosu
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-7273
%P 1-17
%8 2012-06-13
%D 2012
%R 10.1007/978-3-642-30793-5_1
%Z Cognitive science/Computer scienceConference papers
%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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-00909384/document
%2 https://inria.hal.science/hal-00909384/file/978-3-642-30793-5_1_Chapter.pdf
%L hal-00909384
%U https://inria.hal.science/hal-00909384
%~ UGA
%~ CNRS
%~ INRIA
%~ UNIV-GRENOBLE1
%~ UNIV-PMF_GRENOBLE
%~ INPG
%~ INRIA-SOPHIA
%~ INRIA-RHA
%~ LIG
%~ INRIASO
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-WG1-5
%~ IFIP-FMOODS
%~ IFIP-LNCS-7273
%~ INRIA-RENGRE
%~ LIG_SIDCH