How Thorough Is Thorough Enough?

Abstraction is the key for effectively dealing with the state explosion problem in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive answers about properties of interest is notoriously hard. Counterexample-guided abstraction refinement frameworks have been proposed to help build good abstractions iteratively. Although effective in many cases, such frameworks can include unnecessary refinement steps, leading to larger models, because the abstract verification step is not as conclusive as it can be in theory. Abstract verification can be supplemented by a more precise but much more expensive thorough check, but it is not clear how often this check really helps. In this paper, we study the relationship between model-checking and thorough checking and identify practical cases where the latter is not necessary, and those where it can be performed efficiently.

[1]  Orna Grumberg,et al.  A game-based framework for CTL counterexamples and 3-valued abstraction-refinement , 2003, TOCL.

[2]  Andreas Podelski,et al.  Boolean and Cartesian abstraction for model checking C programs , 2001, International Journal on Software Tools for Technology Transfer.

[3]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[4]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[5]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[6]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[7]  Cnrs Fre,et al.  Model Checking a Path (Preliminary Report) , 2003 .

[8]  Marsha Chechik,et al.  Multi-valued symbolic model-checking , 2003, TSEM.

[9]  Radha Jagadeesan,et al.  Model checking partial state spaces with 3-valued temporal logics , 2001 .

[10]  Frank S. de Boer,et al.  An Algebraic Perspective of Constraint Logic Programming , 1997, J. Log. Comput..

[11]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[12]  Orna Kupferman.  Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions , 1995, CAV.

[13]  Marsha Chechik,et al.  Generating Counterexamples for Multi-valued Model-Checking , 2003, FME.

[14]  Stephan Merz,et al.  Model Checking , 2000 .

[15]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[16]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

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

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

[19]  Radha Jagadeesan,et al.  Automatic Abstraction Using Generalized Model Checking , 2002, CAV.

[20]  Marsha Chechik,et al.  Multi-Valued Model Checking via Classical Model Checking , 2003, CONCUR.

[21]  Radha Jagadeesan,et al.  On the Expressiveness of 3-Valued Models , 2002, VMCAI.

[22]  Stefania Gnesi,et al.  FME 2003: Formal Methods: International Symposium of Formal Methods Europe, Pisa, Italy, September 8-14, 2003. Proceedings , 2003, Lecture Notes in Computer Science.

[23]  Bernhard Steffen,et al.  Model-Checking: A Tutorial Introduction , 1999, SAS.

[24]  Tim French.  Decidability of Quantifed Propositional Branching Time Logics , 2001, Australian Joint Conference on Artificial Intelligence.

[25]  Orna Grumberg,et al.  A game-based framework for CTL counterexamples and 3-valued abstraction-refinement , 2007, TOCL.

[26]  Marsha Chechik,et al.  Extending Extended Vacuity , 2004, FMCAD.

[27]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[28]  Markus Stumptner,et al.  AI 2001: Advances in Artificial Intelligence , 2002, Lecture Notes in Computer Science.

[29]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[30]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.