NASA NTRS · 20020079828
Finding Feasible Abstract Counter-Examples
Abstract
A strength of model checking is its ability to automate the detection of subtle system errors and produce traces that exhibit those errors. Given the high computational cost of model checking most researchers advocate the use of aggressive property-preserving abstractions. Unfortunately, the more aggressively a system is abstracted the more infeasible behavior it will have. Thus, while abstraction enables efficient model checking it also threatens the usefulness of model checking as a defect detection tool, since it may be difficult to determine whether a counter-example is feasible and hence worth developer time to analyze. We have explored several strategies for addressing this problem by extending an explicit-state model checker, Java PathFinder (JPF), to search for and analyze counter-examples in the presence of abstractions. We demonstrate that these techniques effectively preserve the defect detection ability of model checking in the presence of aggressive abstraction by applying them to check properties of several abstracted multi-threaded Java programs. These new capabilities are not specific to JPF and can be easily adapted to other model checking frameworks; we describe how this was done for the Bandera toolset.
Keep this discovery
Explore connections, maps & timelines
Pasareanu, Corina S., Dwyer, Matthew B., Visser, Willem, Clancy, Daniel. 2002-01-01. Finding Feasible Abstract Counter-Examples. https://ntrs.nasa.gov/citations/20020079828
Cite the original work for its findings. Save a collection to share your selection of sources.