Conference Paper

Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions

DOI: 10.1007/978-3-540-88387-6_11 Conference: Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings
Source: DBLP


We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithre aded programs. The main idea is to use a lockset based analysis of observed executions to help prune the search space to be explored by the dynamic search. We assume that a state- less search algorithm is used to systematically execute the program in a depth-first search order. If our conservative lockset analysis shows that a search subspace is race-free, it can be pruned away by avoiding backtracks to certain states in the depth-first search. The new dynamic race detection algorith m is both sound and complete (as precise as the dynamic partial order reduction algorithm by Flana- gan and Godefroid). The algorithm is also more efficient in pr actice, allowing it to scale much better to real-world multithreaded C programs.

Full-text preview

Available from:
Show more