Predicate Abstraction with Under-approximation Refinement
<|reference_start|>Predicate Abstraction with Under-approximation Refinement: We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to be generated, but instead executes the concrete transitions while storing abstract versions of the concrete states, as specified by a set of abstraction predicates. For each explored transition the method checks, with the help of a theorem prover, whether there is any loss of precision introduced by abstraction. The results of these checks are used to decide termination or to refine the abstraction by generating new abstraction predicates. If the (possibly infinite) concrete system under analysis has a finite bisimulation quotient, then the method is guaranteed to eventually explore an equivalent finite bisimilar structure. We illustrate the application of the approach for checking concurrent programs.<|reference_end|>
@article{pasareanu2007predicate,
    title={Predicate Abstraction with Under-approximation Refinement},
    author={Corina S. Pasareanu, Radek Pelanek, Willem Visser},
    journal={Logical Methods in Computer Science, Volume 3, Issue 1 (February
  26, 2007) lmcs:2227},
    year={2007},
    doi={10.2168/LMCS-3(1:5)2007},
    archivePrefix={arXiv},
    eprint={cs/0701140},
    primaryClass={cs.GT}
}