This paper introduces ctrees, a monad for modeling nondeterministic, recursive, and impure
programs in Coq. Inspired by **a et al.'s itrees, this novel data structure embeds …

Reversible debugging provides developers with a way to execute their applications both
forward and backward, seeking the cause of an unexpected or undesired event. In a …

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 …

Undoing computations of a concurrent system is beneficial in many situations, eg, in
reversible debugging of multi-threaded programs and in recovery from errors due to …

Reversible computing allows one to execute programs both in the standard, forward
direction, and backward, going back to past states. In a concurrent scenario, the correct …

Reversible computation allows computation to proceed not only in the standard, forward
direction, but also backward, recovering past states. While reversible computation has …

The notion of reversible computation is attracting increasing interest because of its
applications in diverse fields, in particular the study of programming abstractions for reliable …

Causal reversibility blends reversibility and causality for concurrent systems. It indicates that
an action can be undone provided that all of its consequences have been undone already …

The notion of reversible computing is attracting interest because of its applications in diverse
fields, in particular the study of programming abstractions for fault tolerant systems. Most …

CCSK is a reversible form of CCS which is causal, meaning that actions can be reversed if
and only if each action caused by them has already been reversed; there is no control on …