Lienhardt, Michael and Lanese, Ivan and Mezzina, Claudio Antares and Stefani, Jean-Bernard A reversible abstract machine and its space overhead. In: Formal Techniques for Distributed Systems. Lecture Notes in Computer Science (7273). Springer, pp. 1-17. ISBN 978-3-642-30793-5 (2012)
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/978-3-642-30793-5_1 |
| Additional Information: | 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 |
| Projects: | This work has been partially supported by the French National Research Agency (ANR), project REVER n. ANR 11 INSE 007 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 15 Jan 2015 13:24 |
| Last Modified: | 15 Jan 2015 13:24 |
| URI: | http://eprints.imtlucca.it/id/eprint/2491 |
Actions (login required)
 |
Edit Item |
