A randomized dynamic program analysis technique for detecting real deadlocks

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 analysis technique to find potential deadlocks in a multi-threaded program by observing an execution of the program. In the second stage, we control a random thread scheduler to create the potential deadlocks with high probability. Unlike other dynamic analysis techniques, our approach has the advantage that it does not give any false warnings. We have implemented the technique in a prototype tool for Java, and have experimented on a number of large multi-threaded Java programs. We report a number of previously known and unknown real deadlocks that were found in these benchmarks. Categories and Subject Descriptors D.2.5 [Software Engineering]: Testing and Debugging; D.2.4 [Software Engineering]: Software/Program Verification General Terms Languages, Reliability, Verification Keywords deadlock detectio...

• Type: Conference
• Year: 2009
• Where: PLDI
• Authors: Pallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur Naik
• Keywords: Deadlock, Dynamic Analysis Techniques, PLDI 2009, Potential Deadlocks, Programming Languages