Sciweavers

72 search results - page 1 / 15
» An Efficient, Scalable Hardware Engine for Boolean SATisfiab...
Sort
View
ICCD
2006
IEEE
96views Hardware» more  ICCD 2006»
14 years 1 months ago
An Efficient, Scalable Hardware Engine for Boolean SATisfiability
Mandar Waghmode, Kanupriya Gulati, Sunil P. Khatri...
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 1 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
DAC
2009
ACM
14 years 5 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DFT
2005
IEEE
88views VLSI» more  DFT 2005»
13 years 10 months ago
Efficient Exact Spare Allocation via Boolean Satisfiability
Fabricating large memory and processor arrays is subject to physical failures resulting in yield degradation. The strategy of incorporating spare rows and columns to obtain reason...
Fang Yu, Chung-Hung Tsai, Yao-Wen Huang, D. T. Lee...
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 1 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik