Skip to Main content Skip to Navigation
New interface
Book sections

A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs

Abstract : Reversible computing allows one to run programs not only in the usual forward direction, but also backward. A main application area for reversible computing is debugging, where one can use reversibility to go backward from a visible misbehaviour towards the bug causing it. While reversible debugging of sequential systems is well understood, reversible debugging of concurrent and distributed systems is less settled. We present here two approaches for debugging concurrent programs, one based on backtracking, which undoes actions in reverse order of execution, and one based on causal consistency, which allows one to undo any action provided that its consequences, if any, are undone beforehand. The first approach tackles an imperative language with shared memory, while the second one considers a core of the functional message-passing language Erlang. Both the approaches are based on solid formal foundations.
Complete list of metadata

Cited literature [62 references]  Display  Hide  Download
Contributor : Ivan Lanese Connect in order to contact the contributor
Submitted on : Tuesday, November 17, 2020 - 5:21:12 AM
Last modification on : Tuesday, July 5, 2022 - 8:38:23 AM
Long-term archiving on: : Thursday, February 18, 2021 - 6:14:34 PM


Publication funded by an institution




James Hoey, Ivan Lanese, Naoki Nishida, Irek Ulidowski, Germán Vidal. A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs. Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405, pp.108 - 127, 2020, ⟨10.1007/978-3-030-47361-7_5⟩. ⟨hal-03005383⟩



Record views


Files downloads