Making Abstract Model Checking Strongly Preserving

Usually, abstract model checking is not strongly preserving: it mayw ell exist a temporal specification which is not valid on the abstract model but which is instead satisfied bythe concrete model. Starting from the standard notion of bisimulation, we introduce a notion of completeness for abstract models: completeness together with a so-called partitioning propertyfor abstract models implies strong preservation for the past µ-calculus. Within a rigorous abstract interpretation framework, we show that the least refinement of a given abstract model, for a suitable ordering on abstract models, which is complete and partitioning always exists, and it can be constructively characterized as a greatest fixpoint. This provides a systematic methodologyfor minimally refining an abstract model checking in order to get strong preservation.

[1]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[2]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[3]  Yassine Lakhnech,et al.  Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.

[4]  Roberto Giacobazzi,et al.  Refining and Compressing Abstract Domains , 1997, ICALP.

[5]  Roberto Giacobazzi,et al.  Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking , 2001, SAS.

[6]  Patrick Cousot,et al.  Temporal abstract interpretation , 2000, POPL '00.

[7]  Edmund M. Clarke,et al.  Counterexample-Guided Abstraction Refinement , 2000, CAV.

[8]  Francesco Ranzato,et al.  On the Completeness of Model Checking , 2001, ESOP.

[9]  Helmut Veith,et al.  Progress on the State Explosion Problem in Model Checking , 2001, Informatics.

[10]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[11]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[12]  Jürgen Dingel,et al.  Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving , 1995, CAV.

[13]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[14]  Gilberto Filé,et al.  A unifying view of abstract domain design , 1996, CSUR.

[15]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[16]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[17]  Reinhard Wilhelm.  Informatics - 10 Years Back. 10 Years Ahead , 2001, Informatics - 10 Years Back. 10 Years Ahead..