Armin Biere, Alessandro Cimatti, Edmund Clarke, Yunshan Zhu  Home/Search
Context Related
| cmu.edu/anon/1999/CMUCS99101.ps iseran.ira.uka.de/...eZhuTACAS99.ps.gz cmu.edu/~emc/paper...0without%20BDDs.ps 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: cmu.edu/cs1999 (more) From: iseran.ira.uka.de/~armin/publi... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis & Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces... (Update)
Cited by: More
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
Modular Verification of Code with SAT - Greg Dennis Felix (2006) (Correct)
Formal Methods in System Design, 20, 159--186, 2002 c - Verification Of Out-Of-Order (Correct)
Active bibliography (related documents): More All
0.2: Bounded Model Checking Using Satisfiability Solving - Clarke, Biere, Raimi, Zhu (2001) (Correct)
0.1: Symbolic Reachability Analysis based on SAT Solvers - Abdulla, Bjesse, Eén (2000) (Correct)
0.1: Gate Level Description of Synchronous Hardware and Automatic.. - Bjesse (2001) (Correct)
Similar documents based on text: More All
0.4: Improving the Encoding of LTL Model Checking into SAT - Cimatti, Pistore, Roveri.. (2002) (Correct)
0.4: A Fixpoint Based Encoding for Bounded Model Checking - Frisch, Sheridan, Walsh (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
35: Graph-based algorithms for boolean function manipulation - Bryant - 1986
32: Symbolic model checking 10 20 states and beyond - Burch, Clarke et al. - 1992
20: Model Checking - Clarke, Grumberg et al. - 1994
BibTeX entry: (Update)
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS'99, March 1999. http://citeseer.ist.psu.edu/article/biere99symbolic.html More
@article{ biere99symbolic,
author = "Armin Biere and Alessandro Cimatti and Edmund Clarke and Yunshan Zhu",
title = "Symbolic Model Checking without {BDDs}",
journal = "Lecture Notes in Computer Science",
volume = "1579",
pages = "193--207",
year = "1999",
url = "citeseer.ist.psu.edu/article/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
315 Symbolic Model Checking: An Approach to the State Explosion .. (context) - McMillan - 1993
272 Pushing the envelope: planning - Kautz, Selman - 1996
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222 The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
92 Building decision procedures for modal logics from propositi.. - Giunchiglia, Sebastiani - 1996
85 SATO: An efficient propositional prover - Zhang - 1997
84 Another look at LTL model checking - Clarke, Grumberg et al. - 1994
59 Modalities for model checking: Branching time strikes back (context) - Emerson, Lei - 1986
57 Combinational test generation using satisfiability (context) - Stephan, Brayton et al. - 1992
33 The design of a self-timed circuit for distributed mutual ex.. (context) - Martin - 1985
32 DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Johnson, Trick et al. - 1993
14 Modeling and verifying systems and software in propositional.. (context) - Stalmarck, Saflund - 1990
8 The industrial success of verification tools based on Stalma.. (context) - Boralv - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/cs1999.html): More
Learning State Features from Policies to Bias Exploration in.. - Singer, Veloso (1999) (Correct)
A Real-Time Push-Pull Communications Model for Distributed.. - Juvva, Rajkumar (1999) (Correct)
Simple, Efficient Object Encoding using Intersection Types - Crary (1999) (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