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 …

Emerging quantum algorithms for problems such as element distinctness, subset sum, and
closest pair demonstrate computational advantages by relying on abstract data structures …

Debugging of concurrent systems is a tedious and error-prone activity. A main issue is that
there is no guarantee that a bug that appears in the original computation is replayed inside …

Causal-consistent reversible debugging is an innovative technique for debugging
concurrent systems. It allows one to go back in the execution focusing on the actions that …

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 …

This paper presents CoreFun, a typed reversible functional language, which seeks to reduce
typed reversible functional programming to its essentials. We present a complete formal …

A linear-time reversible self-interpreter in an r-Turing complete reversible imperative
language is presented. The proposed imperative language has reversible structured control …

Reversible computation is a paradigm allowing computation to proceed not only in the
usual, forward direction, but also backwards. Reversible computation has been studied in a …

Among the frameworks of bidirectional transformations proposed for addressing various
synchronisation (consistency maintenance) problems, Foster et al.'s [2007] asymmetric …

We introduce a method of reversing the execution of imperative concurrent programs. Given
an irreversible program, we describe the process of producing two versions. The first …