Abstract

Bounded Model Checking (BMC) is an incomplete property checking method that is based on a finite unfolding of the transition relation to disprove the correctness of a set of properties or to prove them for a limited execution lengths from the initial states. Current BMC techniques repeatedly concatenate the original transition relation to unfold the circuit with increasing depths. In this paper we present a new method that is based on a dual unfolding scheme. The first unfolding is non-initialized and progressively simplifies concatenated frames of the transition relation. The tail of the simplified frames are then applied in the second unfolding, which starts from the initial state and checks the properties. We use a circuit graph representation for all functions and performs simplification by merging vertices that are functionally equivalent under given input constraints. In the non-initialized unfolding, previous time frames progressively tighten these constraints thus leading to an asymptotic simplification of the transition relation. As a side benefit, our method can find inductive invariants constructively by detecting when vertices are functionally equivalent across time frames. This information is then used to further simplify the transition relation and, in some cases, prove unbounded correctness of properties. Our experiments using industrial property checking problems demonstrate that the presented method significantly improves the efficiency of BMC.

Citations

1207	Symbolic Model Checking - McMillan - 1993
909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
591	Y.: Symbolic model checking without BDDs - Biere, Cimatti, et al. - 1999
201	BerkMin: a Fast and Robust Sat-Solver - Goldberg, Novikov - 2002
148	J.C.: Verification of synchronous sequential machines based on symbolic execution - Coudert, Berthet, et al.
130	Implicit State Enumeration of Finite State Machines using BDD's - Touati - 1990
129	Checking Safety Properties Using Induction and a SAT-Solver - Sheeran, Singh, et al. - 2000
113	Verification of large synthesized designs - Brand
96	Verification of sequential machines using Boolean functional vectors - Coudert, Berthet, et al. - 1989
92	Automatic abstraction without counter examples - McMillan, Amla - 2003
77	Equivalence checking using cuts and heaps - Kuehlmann, Krohm - 1997
71	Robust boolean reasoning for equivalence checking and functional property verification - Kuehlmann, Paruthi, et al.
64	SAT-based verification without state space traversal - Bjesse, Claessen - 2000
61	Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis - Chauhan, Clarke, et al. - 2002
48	An efficient tool for logic verification based on recursive learning - Kunz, “HANNIBAL - 1993
41	Property checking via structural analysis - Baumgartner, Kuehlmann, et al. - 2002
33	Using SAT for combinational equivalence checking - Goldberg, Prasad, et al.
33	A circuit SAT solver with signal correlation guided learning - Lu, Wang, et al.
32	Efficient computation of recurrence diameters - Kroening, Strichman - 2003
31	Transformation-based verification using generalized retiming - Kuehlmann, Baumgartner - 2001
28	Eijk. ”Sequential equivalence checking based on structural similarities - van
23	Pruning techniques for the SAT-based bounded model checking problem - Shtrichman - 2001
18	Logic optimization and equivalence checking by implication analysis - Kunz, Stoffel, et al. - 1997
17	Record & Play: A Structural Fixed Point Iteration for Sequential Circuit Verification - Stoffel, Kunz - 1997
13	Dynamic Detection and Removal of Inactive Clauses - Gupta, Gupta, et al. - 2001
13	Improved SAT-based Bounded Reachability Analysis - Ganai, Aziz - 2002
12	A method for symbolic verification of synchronous circuits - Filkorn - 1991
12	Optimizing sequential verification by retiming transformations - Cabodi, Quer, et al. - 2000
7	A.M.: Using induction and BDDs to model check invariants - Déharbe, Moreira - 1997
3	A Structural Fixpoint Iteration for Sequential Logic Equivalence Checking Based On Retiming - Stoffel, Kunz - 1997