A Reversible Abstract Machine and Its Space Overhead

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.

Domains

Computer science

Fichier principal

978-3-642-30793-5_1_Chapter.pdf (194.48 Ko)

Origin	Files produced by the author(s)

Davide Sangiogi : Connect in order to contact the contributor

https://inria.hal.science/hal-00909384

Submitted on : Monday, May 29, 2017-4:06:06 PM

Last modification on : Monday, December 9, 2024-3:35:05 AM

Long-term archiving on : Wednesday, September 6, 2017-11:28:16 AM

Dates and versions

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

Licence

Attribution

Identifiers

HAL Id : hal-00909384 , version 1
DOI : 10.1007/978-3-642-30793-5_1

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA CNRS INRIA LIG IFIP-LNCS IFIP INRIA2 IFIP-TC IFIP-WG IFIP-TC6 IFIP-WG6-1 IFIP-FORTE IFIP-FMOODS IFIP-LNCS-7273 LIG_SIDCH

457 View

147 Download