Model checking procedures for infinite state systems

The paper depicts experiments and results with predicate abstraction based verification applied to infinite state systems. Predicate abstraction is a method for automatic construction of abstract state space that can be used by any common finite state model checking tool, such as NuSMV. We have used abstract state space and NuSMV tool to verify safety properties of infinite state mutual exclusion protocols. Even though predicate abstraction allows model checking against a restricted class of temporal logic formulas, we have shown that the restricted class is expressive enough to specify basic safety properties. Our experiments were conducted on Bakery and Fischer mutual exclusion protocols

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

[2]  Annabelle McIver,et al.  Programming Methodology , 1974, Lecture Notes in Computer Science.

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

[4]  Harald Ruess,et al.  Predicate Abstraction for Dense Real-Time Systems , 2001 .

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

[6]  Natarajan Shankar.  Automated verification using deduction, exploration, and abstraction , 2003 .

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

[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]  N. Bogunovic,et al.  Verification of mutual exclusion algorithms with SMV system , 2003, The IEEE Region 8 EUROCON 2003. Computer as a Tool..

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

[11]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[12]  Nikola Bogunović,et al.  Formal Verification of Communication Protocols in Distributed Systems , 2003 .

[13]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[14]  N. Bogunovic,et al.  Formal verification of logical link control and adaptation protocol , 2004, Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference (IEEE Cat. No.04CH37521).

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