Guided model checking for programs with polymorphism

Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concrete execution of the program toward a possible error location. The estimate is a und computed on a statically generated abstract model of the program that ignores all data values and only considers control flow. In this paper we describe a new distance estimate heuristic that efficiently computes a tighter lower-bound in programs with polymorphism when compared to the state of the art distance heuristic. We statically generate conservative distance estimates and refine the estimates when the targets of dynamic method invocations are resolved. In our empirical analysis the state of the art approach is computationally infeasible for large programs with polymorphism while our new distance heuristic can quickly detect the errors. Categories and Subject Descriptors D.2.4 [Software Engineering]: Software/Program ...

• Type: Conference
• Year: 2009
• Where: PEPM
• Authors: Neha Rungta, Eric G. Mercer
• Keywords: Conservative Distance Estimates, Distance Estimate Heuristics, Model Checking Search, PEPM 2009, Software Engineering