Model-checking infinite state-space systems with fine-grained abstractions using SPIN

In analyzing infinite-state systems, it is often useful to define multiple-valued predicates. Such predicates can determine the (finite) levels of desirability of the current system state and transitions between them. We can capture multiple-valued predicates as elements of a logic defined over finite total orders (FTOs). In this paper we extend automata-theoretic LTL model-checking to reasoning about a class of multiple-valued logics. We also show that model-checking over FTOs is reducible to classical model-checking, and thus can be implemented in SPIN.

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

[2]  Melvin Fitting,et al.  Many-valued modal logics , 1991, Fundam. Informaticae.

[3]  Jonathan S. Golan,et al.  Power algebras over semirings , 1999 .

[4]  Brian R. Gaines,et al.  Logical foundations for database systems , 1979 .

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

[6]  Constance L. Heitmeyer,et al.  Automated consistency checking of requirements specifications , 1996, TSEM.

[7]  Melvin Fitting,et al.  Many-valued modal logics II , 1992 .

[8]  David L. Dill,et al.  Experience with Predicate Abstraction , 1999, CAV.

[9]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[10]  David L. Dill,et al.  Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.

[11]  Matthew L. Ginsberg,et al.  Multi-Valued Logics , 1986, AAAI.

[12]  Tomás E. Uribe,et al.  Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures , 1998, CAV.

[13]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[14]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[15]  Patrice Godefroid,et al.  Model Checking Partial State Spaces with 3-Valued Temporal Logics , 1999, CAV.

[16]  Marsha Chechik,et al.  Efficient Multiple-Valued Model-Checking Using Lattice Representations , 2001, CONCUR.

[17]  Marsha Chechik,et al.  Implementing a Multi-valued Symbolic Model Checker , 2001, TACAS.

[18]  Natarajan Shankar,et al.  Abstract and Model Check While You Prove , 1999, CAV.

[19]  Patrick Cousot,et al.  Static determination of dynamic properties of generalized type unions , 1977, Language Design for Reliable Software.

[20]  Reiner Hähnle,et al.  Verification of Switch-Level Designs with Many-Valued Logic , 1993, LPAR.

[21]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[22]  Marsha Chechik,et al.  Lightweight Reasoning about Program Correctness , 2001, Inf. Syst. Frontiers.

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

[24]  Ryszard S. Michalski,et al.  Variable-Valued Logic and Its Applications to Pattern Recognition and Machine Learning , 1975 .

[25]  Annabelle McIver,et al.  Probabilistic Models for the Guarded Command Language , 1997, Sci. Comput. Program..

[26]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[27]  D. V. Lindley,et al.  An Introduction to Probability Theory and Its Applications. Volume II , 1967, The Mathematical Gazette.

[28]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[29]  John Penix,et al.  Using predicate abstraction to reduce object-oriented programs for model checking , 2000, FMSP '00.

[30]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .