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 …

We provide a new characterization of scheduling nondeterminism by allowing deterministic
schedulers to delay their next-scheduled task. In limiting the delays an otherwise …

RoadRunner is a dynamic analysis framework designed to facilitate rapid prototy** and
experimentation with dynamic analyses for concurrent Java programs. It provides a clean …

Deadlocks still severely inflict reliability and security issues upon software systems of the
modern age. Worse still, as we note, in prior static deadlock detectors, good precision does …

Concurrency bugs are notoriously difficult to detect because there can be vast combinations
of interleavings among concurrent threads, yet only a small fraction can reveal them. Atomic …

As writing concurrent programs is challenging, developers often rely on thread-safe classes,
which encapsulate most synchronization issues. Testing such classes is crucial to ensure …

The effectiveness of software testing is often assessed by measuring coverage of some
aspect of the software, such as its code. There is much research aimed at increasing code …

Predictive analysis is a powerful technique that exposes concurrency bugs in un-exercised
program executions. However, current predictive analysis approaches lack the …

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

With a growing demand of concurrent software to exploit multi-core hardware capability,
concurrency vulnerabilities have become an inevitable threat to the security of today's IT …