Symbolic Model Checking Using SAT Procedures instead of BDDs

Symbolic Model Checking Using SAT Procedures instead of BDDs (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by A. Biere , A. Cimatti , E. M. Clarke , M. Fujita , Y. Zhu

Citations:

230 - 20 self

BibTeX

@INPROCEEDINGS{Biere99symbolicmodel,
    author = {A. Biere and A. Cimatti and E. M. Clarke and M. Fujita and Y. Zhu},
    title = {Symbolic Model Checking Using SAT Procedures instead of BDDs},
    booktitle = {},
    year = {1999},
    pages = {317--320}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper, we study the application of propositional decision procedures in hardware verification. In particular, we apply bounded model checking, as introduced in [1], to equivalence and invariant checking. We present several optimizations that reduce the size of generated propositional formulas. In many instances, our SAT-based approach can significantly outperform BDD-based approaches. We observe that SAT-based techniques are particularly efficient in detecting errors in both combinational and sequential designs. 1

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
926	A computing procedure for quantification theory - Davis, Putnam - 1960
698	Design and synthesis of synchronization skeletons using branching time temporal logic - Clarke, Emerson - 1981
591	Y.: Symbolic model checking without BDDs - Biere, Cimatti, et al. - 1999
575	Model Checking and Abstraction - Clarke, Grumberg, et al. - 1994
488	L.J.: Symbolic model checking: 10 20 states and beyond - Burch, Clarke, et al. - 1992
464	Symbolic model checking: An approach to the state explosion problem - Mcmillan - 1992
356	SIS: A system for sequential circuit synthesis - Sentovich, Singh, et al. - 1992
319	Symbolic model checking: 10 states and beyond - Burch, Clarke, et al. - 1990
175	SATO: An efficient propositional prover - Zhang - 1997
157	A Structure-preserving Clause Form Translation - Plaisted, Greenbaum - 1986
84	Symbolic Model Checking - Burch, Clarke, et al. - 1992
60	System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from Boolean Formula,” United States Patent no - Stalmarck - 1994
48	An efficient tool for logic verification based on recursive learning - Kunz, “HANNIBAL - 1993
43	The Design of a Self-timed Circuit for Distributed Mutual Exclusion - Martin
17	A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking - McMillan - 1996
11	Second dimacs implementation challenge: cliques, coloring and satisfiability - Johnson, Trick - 1996
10	The industrial success of verification tools based on St˚almarck’s Method - Borälv - 1997
7	A.M.: Using induction and BDDs to model check invariants - Déharbe, Moreira - 1997
3	A system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula,1989. Swedish patent no. 467 076(1992), U.S. patent no. 5 276 897(1994), European patent no - ˚ALMARCK, G - 1995
2	FLOVER: Filtering oriented combinational verification approach - MUKHERJEE, JAIN, et al. - 1995
1	The industrial success of verification tools based on Stalmarck's Method - ALV, A - 1997