112 search results - page 1 / 23 » Ordered Binary Decision Diagrams and the Davis-Putnam Proced... |
CCL
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
ISQED
2002
IEEE
13 years 9 months ago
2002
IEEE
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
VLSID
2005
IEEE
13 years 9 months ago
2005
IEEE
In recent years, there has been an increasing interest in Quantified Boolean Formula (QBF) evaluation, since several VLSI CAD problems can be formulated efficiently as QBF insta...
CL
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
CAP
2010
12 years 11 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...