Abstract interpretation-based model checking provides an approach to verifying properties of inﬁnite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be veriﬁed. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.
Model checking; Program analysis; Abstract Interpretation
Main Research Area:
23rd Workshop on Constraint Logic Programming (WLP 2009)