Corina S. Pasareanu ; Radek Pelanek ; Willem Visser - Predicate Abstraction with Under-approximation Refinement

lmcs:2227 - Logical Methods in Computer Science, February 26, 2007, Volume 3, Issue 1 - https://doi.org/10.2168/LMCS-3(1:5)2007
Predicate Abstraction with Under-approximation Refinement

Authors: Corina S. Pasareanu ; Radek Pelanek ORCID-iD; Willem Visser

    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.


    Volume: Volume 3, Issue 1
    Published on: February 26, 2007
    Submitted on: February 3, 2006
    Keywords: Computer Science - Computer Science and Game Theory,D.2.4,F.3.1

    7 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 320 times.
    This article's PDF has been downloaded 335 times.