论文信息 - Formal Verification of Infinite State Systems Using Boolean Methods

Formal Verification of Infinite State Systems Using Boolean Methods

The UCLID project seeks to develop formal verification tools for infinite-state systems having a degree of automation comparable to that of model checking tools for finite-state systems. The UCLID modeling language describes systems where the state variables are Booleans, integers, and functions mapping integers to integers or Booleans. The verifier supports several forms of verification for proving safety properties. They rely on a decision procedure that translates a quantifier-free formula into an equi-satisfiable Boolean formula and then applies a Boolean satisfiability solver. UCLID has successfully verified a number of hardware designs and protocols

Randal E. Bryant | R. Bryant

[1] Shuvendu K. Lahiri,et al. Indexed Predicate Discovery for Unbounded System Verification , 2004, CAV.

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

[3] Sanjit A. Seshia,et al. Convergence Testing in Term-Level Bounded Model Checking , 2003, CHARME.

[4] Rasmus Ejlers Møgelberg,et al. Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .

[5] R. BurchJ.,et al. Symbolic model checking , 1992 .

[6] Sanjit A. Seshia,et al. Modeling and Verification of Out-of-Order Microprocessors in UCLID , 2002, FMCAD.

[7] Shuvendu K. Lahiri,et al. Predicate abstraction with indexed predicates , 2004, TOCL.

[8] Kenneth L. McMillan,et al. Symbolic model checking , 1992 .

[9] Sanjit A. Seshia,et al. Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions , 2002, CAV.

[10] Sanjit A. Seshia,et al. The UCLID Decision Procedure , 2004, CAV.

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