Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures

We present an algorithm that uses decision procedures to generate finite-state abstractions of possibly infinite-state systems. The algorithm compositionally abstracts the transitions of the system, relative to a given, fixed set of assertions. Thus, the number of validity checks is proportional to the size of the system description, rather than the size of the abstract state-space. The generated abstractions are weakly preserving for ∀CTL temporal properties. We describe several applications of the algorithm, implemented using the decision procedures of the Stanford Temporal Prover (STeP).

[1]  Theo C. Ruys,et al.  The Bounded Retransmission Protocol Must Be on Time! , 1997, TACAS.

[2]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Zohar Manna,et al.  Clocked Transition Systems , 1996 .

[4]  Henny B. Sipma,et al.  Deductive Model Checking , 1996, Formal Methods Syst. Des..

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

[6]  Dennis Dams,et al.  Practical symbolic model checking of the full µ-calculus using compositional abstractions , 1995 .

[7]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

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

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

[10]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[11]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

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

[13]  Zohar Manna,et al.  Automatic Generation of Invariants and Intermediate Assertions , 1997, Theor. Comput. Sci..

[14]  Howard Wong-Toi,et al.  Symbolic approximations for verifying real-time systems , 1995 .

[15]  David L. Dill,et al.  Verification of Real-Time Systems by Successive Over and Under Approximation , 1995, CAV.

[16]  Edward Y. Chang,et al.  STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems , 1996, CAV.

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

[18]  Abelardo Pardo,et al.  Automatic Abstraction Techniques for Propositional µ-calculus Model Checking , 1997, CAV.

[19]  Zohar Manna,et al.  Temporal Verification of Simulation and Refinement , 1993, REX School/Symposium.

[20]  Natarajan Shankar,et al.  Experiments in Theorem Proving and Model Checking for Protocol Verification , 1996, FME.

[21]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

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

[23]  Henny B. Sipma,et al.  Deductive Model Checking , 1996, CAV.

[24]  Nikolaj Bjørner,et al.  A Practical Integration of First-Order Reasoning and Decision Procedures , 1997, CADE.