| Alternate document: Details Symbolic Model Checking without BDDs (99) Armin Biere, Alessandro Cimatti, Edmund Clarke, Yunshan Zhu |
A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu  Home/Search
Context Related
| iseran.ira.uka.de/...itaZhuDAC99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iseran.ira.uka.de/~armin/publi... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Localizing Errors in Counterexample with - Iteratively Witness Searching (Correct)
Minimizing Counterexample - With Unit Core (Correct)
Exploiting Subformula Sharing in Automatic - Analysis Of Quanti (2003) (Correct)
Active bibliography (related documents): More All
0.5: Bounded Model Checking Using Satisfiability Solving - Clarke, Biere, Raimi, Zhu (2001) (Correct)
0.3: Equivalence Checking of Combinational Circuits using.. - Hulgaard, Williams.. (1999) (Correct)
0.3: On the Efficiency of Learning Techniques for Combinational.. - van Eijk, Janssen (Correct)
Similar documents based on text: More All
0.4: Efficient Computation of Recurrence Diameters - Kroening, Strichman (2003) (Correct)
0.4: Improving the Encoding of LTL Model Checking into SAT - Cimatti, Pistore, Roveri.. (2002) (Correct)
0.4: Can BDDs compete with SAT solvers on Bounded Model Checking? - Cabodi, Camurati, Quer (2002) (Correct)
Related documents from co-citation: More All
45: Graph-based algorithms for boolean function manipulation - Bryant - 1986
37: Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
26: Symbolic model checking 10 20 states and beyond - Burch, Clarke et al. - 1992
BibTeX entry: (Update)
A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. 36th Design Automaion Conference, pages 317-- 320. IEEE Computer Society, 1999. http://citeseer.ist.psu.edu/biere99symbolic.html More
@inproceedings{ biere99symbolic,
author = "Armin Biere and Alessandro Cimatti and Edmund M. Clarke and M. Fujita and Y. Zhu",
title = "Symbolic Model Checking using {SAT} procedures instead of {BDD}s",
booktitle = "Proceedings of Design Automation Conference ({DAC}'99)",
year = "1999",
url = "citeseer.ist.psu.edu/biere99symbolic.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - BRYANT - 1986
779 Symbolic model checking: 10 20 states and beyond - BURCH, CLARKE et al. - 1992
459 A computing procedure for quantification theory (context) - DAVIS, PUTNAM - 1960
397 Design and synthesis of synchronization skeletons using bran.. (context) - CLARKE, EMERSON - 1981
372 SIS: A System for Sequential Circuit Synthesis - SENTOVICH, SINGH et al. - 1992
315 Symbolic Model Checking: An Approach to the State Explosion .. (context) - MCMILLAN - 1993
244 Symbolic model checking without BDDs - BIERE, CIMATTI et al. - 1999
94 A structure-preserving clause form translation (context) - PLAISTED, GREENBAUM - 1986
85 SATO: An efficient propositional prover - ZHANG - 1997
33 The design of a self-timed circuit for distributed mutual ex.. (context) - MARTIN - 1985
23 HANNIBAL: An efficient tool for logic verification based on .. (context) - KUNZ - 1993
18 A conjunctively decomposed boolean representation for symbol.. (context) - MCMILLAN - 1996
3 FLOVER: Filtering oriented combinational verification approa.. (context) - MUKHERJEE, JAIN et al. - 1995
2 The industrial success of verification tools based on Stalma.. (context) - ALV - 1997
1 Using induction and BDDs to model check invariants (context) - DEHARBE - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://iseran.ira.uka.de/~armin/publications/): More
Combining Symbolic Model Checking with Uninterpreted.. - Berezin, Biere.. (1998) (Correct)
Symbolic Model Checking without BDDs - Biere, Cimatti, Clarke, Zhu (1999) (Correct)
A Performance Study of BDD-Based Model Checking - Yang, Bryant, O'Hallaron.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC