Reversibility in Erlang: Imperative Constructs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Reversibility in Erlang: Imperative Constructs


A relevant application of reversibility is causal-consistent reversible debugging, which allows one to explore concurrent computations backward and forward to find a bug. This approach has been put into practice in CauDEr, a causal-consistent reversible debugger for the Erlang programming language. CauDEr supports the functional, concurrent and distributed fragment of Erlang. However, Erlang also includes imperative features to manage a map (shared among all the processes of a same node) associating process identifiers to names. Here we extend CauDEr and the related theory to support such imperative features. From a theoretical point of view, the added primitives create different causal structures than those derived from the concurrent Erlang fragment previously handled in CauDEr, yet we show that the main results proved for CauDEr are still valid.
Fichier principal
Vignette du fichier
semantics.pdf (1.43 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : Copyright

Dates and versions

hal-03915947 , version 1 (30-12-2022)





Pietro Lami, Ivan Lanese, Jean-Bernard Stefani, Claudio Sacerdoti Coen, Giovanni Fabbretti. Reversibility in Erlang: Imperative Constructs. RC 2022 - 14th International Conference on Reversible Computation, Jul 2022, Urbino, Italy. pp.187-203, ⟨10.1007/978-3-031-09005-9_13⟩. ⟨hal-03915947⟩
17 View
10 Download



Gmail Facebook Twitter LinkedIn More