Abstract

Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances. 1

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
591	Y.: Symbolic model checking without BDDs - Biere, Cimatti, et al. - 1999
510	An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986
488	L.J.: Symbolic model checking: 10 20 states and beyond - Burch, Clarke, et al. - 1992
287	GRASP – a new search algorithm for satisfiability - Silva, Sakallah - 1997
219	A.: Checking that finite state concurrent programs satisfy their linear specification - Lichtenstein, Pnueli - 1985
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.
129	Checking Safety Properties Using Induction and a SAT-Solver - Sheeran, Singh, et al. - 2000
120	bounds for resolution and cutting plane proofs and monotone computations - Pudlák, “Lower - 1997
92	Automatic abstraction without counter examples - McMillan, Amla - 2003
81	M.Y.: Model checking of safety properties - Kupferman, Vardi
79	Validating SAT solvers using an independent resolutionbased checker: Practical implementations and other applications - Zhang, Malik - 2003
73	Benefits of bounded model checking at an industrial setting - Copty, Fix, et al. - 2001
72	reasoning. A new form of the Herbrand-Gentzen theorem - Linear - 1957
68	Symbolic Reachability Analysis based on SAT-Solvers - Abdulla, Bjesse, et al. - 2000
55	Finding bugs in an Alpha microprocessor using satisfiability solvers - Bjesse, Leonard, et al. - 2001
41	Property checking via structural analysis - Baumgartner, Kuehlmann, et al. - 2002
40	Combining decision diagrams and SAT procedures for efficient symbolic model checking - Williams, Biere, et al. - 2000
32	Liveness checking as safety checking - Biere, Schuppan - 2002
25	SAT-based image computation with application in reachability analysis - Gupta, Yang, et al. - 2000
25	A structure preserving clause form translation - Plaisted, Greenbaum - 1986
7	a fast and robust sat-solver - Berkmin - 2002
3	Symbolic model checking with sets of states represented as formulas - Bjesse - 1999