Deterministic replay is a type of emerging technique dedicated to providing deterministic
executions of computer programs in the presence of nondeterministic factors. The …

Reproducing bugs is hard. Deterministic replay systems address this problem by providing a
high-fidelity replica of an original program run that can be repeatedly executed to zero-in on …

The behavior of a multithreaded program does not depend only on its inputs. Scheduling,
memory reordering, timing, and low-level hardware effects all introduce nondeterminism in …

Current shared memory multicore and multiprocessor systems are nondeterministic. Each
time these systems execute a multithreaded application, even if supplied with the same …

Deterministic replay systems record and reproduce the execution of a hardware or software
system. In contrast to replaying execution on uniprocessors, deterministic replay on …

Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately,
reproducing a concurrency bug on multi-processors (eg, multi-core) is challenging. Previous …

Deterministic replay systems record and reproduce the execution of a hardware or software
system. While it is well known how to replay uniprocessor systems, replaying shared …

The ability to record and replay program executions with low overhead enables many
applications, such as reverse-execution debugging, debugging of hard-to reproduce test …

The vast majority of state produced by a typical computer is generated, consumed, then lost
forever. We argue that a computer system should instead provide the ability to recall any …

We present CLAP, a new technique to reproduce concurrency bugs. CLAP has two key
steps. First, it logs thread local execution paths at runtime. Second, offline, it computes …