Dynamic Deadlock Analysis of Multi-threaded Programs

10 years 5 months ago
Dynamic Deadlock Analysis of Multi-threaded Programs
This paper presents a dynamic program analysis algorithm that can detect deadlock potentials in a multi-threaded program by examining a single execution trace, obtained by running an instrumented version of the program. The algorithm is interesting because it can identify deadlock potentials even though no deadlocks occur in the examined execution, and therefore it scales very well in contrast to more formal approaches to deadlock detection. It is an improvement of an existing algorithm in that it reduces the number of false positives (false warnings). The paper describes an implementation and an application to three case studies.
Saddek Bensalem, Klaus Havelund
Added 29 Jun 2010
Updated 29 Jun 2010
Type Conference
Year 2005
Where HVC
Authors Saddek Bensalem, Klaus Havelund
Comments (0)