We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded
programs. Our technique runs in two stages. In the first stage, we use an imprecise dynamic …

Deadlock immunity is a property by which programs, once afflicted by a given deadlock,
develop resistance against future occurrences of that and similar deadlocks. We describe a …

Deadlock is an increasingly pressing concern as the multicore revolution forces parallel
programming upon the average programmer. Existing approaches to deadlock impose …

We present MagicFuzzer, a novel dynamic deadlock detection technique. Unlike existing
techniques to locate potential deadlock cycles from an execution, it iteratively prunes lock …

Symbolic execution can be used to explore the possible run-time states of a program. It
makes use of a concept of “state” where a variable's value has been replaced by an …

Many predictive deadlock detection techniques analyze multithreaded programs to suggest
potential deadlocks (referred to as cycles or deadlock warnings). Nonetheless, many of such …

High-performance concurrent libraries, such as lock-free data structures and custom
synchronization primitives, are notoriously difficult to write correctly. Such code is often …

We present Magiclock, a novel potential deadlock detection technique by analyzing
execution traces (containing no deadlock occurrence) of large-scale multithreaded …

In recent years, GPUs have emerged as an extremely cost-effective means for achieving
high performance. While languages like CUDA and OpenCL have eased GPU programming …

In this paper we present a precise data race detection technique for distributed memory
parallel programs. Our technique, which we call Active Testing, builds on our previous work …