Sciweavers

Share
SIGSOFT
2010
ACM

An effective dynamic analysis for detecting generalized deadlocks

9 years 9 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread or insidious, deadlocks involving condition variables. Our analysis consists of two stages. In the first stage, our analysis observes a multi-threaded program execution and generates a simple multi-threaded program, called a trace program, that only records operations observed during the execution that are deemed relevant to finding deadlocks. Such operations include lock acquire and release, wait and notify, thread start and join, and change of values of user-identified synchronization predicates associated with condition variables. In the second stage, our analysis uses an off-the-shelf model checker to explore all possible thread interleavings of the trace program and check if any of them deadlocks. A key advantage of our technique is that it discards most of the program logic which usually causes state-s...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where SIGSOFT
Authors Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
Comments (0)
books