Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

90

Voted

DAC
2002
ACM

95views Computer Architecture» more DAC 2002»

Can BDDs compete with SAT solvers on bounded model checking?

16 years 3 months ago

Can BDDs compete with SAT solvers on bounded model checking?

Download lcs.ios.ac.cn

Gianpiero Cabodi, Paolo Camurati, Stefano Quer

Real-time Traffic

DAC 2002 | Design Automation |

claim paper

Related Content

» Learning from BDDs in SATbased bounded model checking

» Improving SATBased Bounded Model Checking by Means of BDDBased Approximate Traversals

» CirCUs A Satisfiability Solver Geared towards Bounded Model Checking

» Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reach...

» Tuning SAT Checkers for Bounded Model Checking

» Methods for exploiting SAT solvers in unbounded model checking

» Refining the SAT decision ordering for bounded model checking

» SATBased Summarization for Boolean Programs

» Bounded Model Checking with Parametric Data Structures

Post Info
More Details (n/a)

Added	13 Nov 2009
Updated	13 Nov 2009
Type	Conference
Year	2002
Where	DAC
Authors	Gianpiero Cabodi, Paolo Camurati, Stefano Quer

Comments (0)