论文信息 - Efficient implementation of property directed reachability

Efficient implementation of property directed reachability

Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken McMillan's interpolation based model checking procedure introduced in 2003. Our experience with the algorithm suggests that it is stronger than interpolation on industrial problems, and that it is an important algorithm to study further. In this paper, we present a simplified and faster implementation of Bradley's procedure, and discuss our successful and unsuccessful attempts to improve it.

[1] Gianpiero Cabodi,et al. Boosting interpolation with dynamic localized abstraction and redundancy removal , 2008, TODE.

[2] Gianpiero Cabodi,et al. Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .

[4] Zohar Manna,et al. Checking Safety by Inductive Generalization of Counterexamples to Induction , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[5] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[6] Aaron R. Bradley,et al. SAT-Based Model Checking without Unrolling , 2011, VMCAI.

[7] Robert K. Brayton,et al. Scalable and scalably-verifiable sequential synthesis , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[8] Kenneth L. McMillan,et al. Interpolation and SAT-Based Model Checking , 2003, CAV.

[9] Alan Mishchenko,et al. A single-instance incremental SAT formulation of proof- and counterexample-based abstraction , 2010, Formal Methods in Computer Aided Design.