Issue No. 03 - March (1996 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.489078
<p><b>Abstract</b>—Static analysis of concurrent programs has been hindered by the well known state explosion problem. Although many different techniques have been proposed to combat this state explosion, there is little empirical data comparing the performance of the methods. This information is essential for assessing the practical value of a technique and for choosing the best method for a particular problem. In this paper, we carry out an evaluation of three techniques for combating the state explosion problem in deadlock detection: reachability search with a partial order state space reduction, symbolic model checking, and inequality necessary conditions. We justify the method used for the comparison, and carefully analyze several sources of potential bias. The results of our evaluation provide valuable data on the kinds of programs to which each technique might best be applied. Furthermore, we believe that the methodological issues we discuss are of general significance in comparison of analysis techniques.</p>
Concurrency analysis, empirical evaluation, state space reduction, symbolic model checking, inequality necessary conditions, Ada tasking.
James C. Corbett, "Evaluating Deadlock Detection Methods for Concurrent Software", IEEE Transactions on Software Engineering, vol. 22, no. , pp. 161-180, March 1996, doi:10.1109/32.489078