Dynamic deadlock analysis of multi-threaded programs

49Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Bensalem, S., & Havelund, K. (2006). Dynamic deadlock analysis of multi-threaded programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3875 LNCS, pp. 208–223). Springer Verlag. https://doi.org/10.1007/11678779_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free