Sciweavers

31 search results - page 1 / 7
» An Integrated Approach for Combining BDD and SAT Provers
Sort
View
VLSID
2006
IEEE
121views VLSI» more  VLSID 2006»
14 years 5 months ago
An Integrated Approach for Combining BDD and SAT Provers
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
Rolf Drechsler, Görschwin Fey, Sebastian Kind...
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
13 years 9 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
JAIR
2010
145views more  JAIR 2010»
13 years 3 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
DATE
2004
IEEE
116views Hardware» more  DATE 2004»
13 years 9 months ago
A Novel SAT All-Solutions Solver for Efficient Preimage Computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
Bin Li, Michael S. Hsiao, Shuo Sheng
JAR
2000
145views more  JAR 2000»
13 years 5 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro