A reversible abstract machine and its space overhead
M Lienhardt, I Lanese, CA Mezzina… - … Conference on Formal …, 2012 - Springer
International Conference on Formal Methods for Open Object-Based Distributed …, 2012•Springer
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.
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果