Sciweavers

295 search results - page 25 / 59
» SAT, SMT and Applications
Sort
View
FPL
2003
Springer
95views Hardware» more  FPL 2003»
15 years 7 months ago
Reconfigurable Hardware SAT Solvers: A Survey of Systems
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
Iouliia Skliarova, António de Brito Ferrari
SAT
2010
Springer
141views Hardware» more  SAT 2010»
15 years 5 months ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
TCAD
2002
121views more  TCAD 2002»
15 years 1 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
TIT
2008
107views more  TIT 2008»
15 years 1 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
VLSID
2007
IEEE
91views VLSI» more  VLSID 2007»
16 years 2 months ago
Reusing Learned Information in SAT-based ATPG
The robustness of engines for ATPG has to be improved to cope with the growing size of circuits. Recently, SAT-based ATPG approaches have been shown to be very robust even on larg...
Görschwin Fey, Rolf Drechsler, Tim Warode