129 search results - page 22 / 26 » Logical Cryptanalysis as a SAT Problem |
102
click to vote
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
88
Voted
VTS
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a pseudo-functional BIST scheme that attempts to minimize the over-testing problem of logic BIST for delay and crosstalk-induced failures. The over-testing pro...
100
Voted
AC
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
FM
2008
Springer
15 years 1 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
AAAI
2004
15 years 1 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...