12 citations · 31 across the 17 of their papers we have counts for
12 papers · 1 filter
Causal-Consistent Reversible Debugging: Improving CauDEr
Juan José González-Abril, Germán Vidal
Causal-consistent reversible debugging allows one to explore concurrent computations back and forth in order to locate the source of an error. In this setting, backward steps can b…
Computing Race Variants in Message-Passing Concurrent Programming with Selective Receives
Germán Vidal
Message-passing concurrency is a popular computation model that underlies several programming languages like, e.g., Erlang, Akka, and (to some extent) Go and Rust. In particular, w…
A Lightweight Approach to Computing Message Races with an Application to Causal-Consistent Reversible Debugging
Juan José González-Abril, Germán Vidal
This paper presents a lightweight formalism (a trace) to model message-passing concurrent executions where some common common problems can be identified, like lost or delayed messa…
A Program Instrumentation for Prefix-Based Tracing in Message-Passing Concurrency
Juan José González-Abril, Germán Vidal
The execution of concurrent programs generally involves some degree of nondeterminism, mostly due to the relative speeds of the concurrent processes. As a consequence, reproducibil…
Reversible Debugging in Logic Programming
Germán Vidal
Reversible debugging is becoming increasingly popular for locating the source of errors. This technique proposes a more natural approach to debugging, where one can explore a compu…
A Theory of Reversibility for Erlang
Ivan Lanese, Naoki Nishida, Adrián Palacios +1
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 programmin…