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.

Domaines

Informatique

Fichier principal

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

Origine : Fichiers produits par l'(les) auteur(s)

Davide Sangiogi : Connectez-vous pour contacter le contributeur

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

Soumis le : lundi 29 mai 2017-16:06:06

Dernière modification le : jeudi 4 avril 2024-21:37:57

Archivage à long terme le : mercredi 6 septembre 2017-11:28:16

Dates et versions

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

Licence

Paternité

Identifiants

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

Citer

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⟩

Exporter

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

429 Consultations

121 Téléchargements