A theory of reversibility for Erlang - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logical and Algebraic Methods in Programming Year : 2018

A theory of reversibility for Erlang


In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for testing and verification, among others. In this paper, we consider a subset of Erlang, a functional and concurrent programming language based on the actor model. We present a formal semantics for reversible computation in this language and prove its main properties, including its causal consistency. We also build on top of it a rollback operator that can be used to undo the actions of a process up to a given checkpoint.
Fichier principal
Vignette du fichier
paper.pdf (571.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01912856 , version 1 (06-11-2018)



Ivan Lanese, Naoki Nishida, Adrian Palacios, Germán Vidal. A theory of reversibility for Erlang. Journal of Logical and Algebraic Methods in Programming, 2018, 100, pp.71 - 97. ⟨10.1016/j.jlamp.2018.06.004⟩. ⟨hal-01912856⟩
78 View
108 Download



Gmail Facebook X LinkedIn More