86 search results - page 8 / 18 » The state of SAT |
ICCAD
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
IH
2004
Springer
14 years 27 days ago
2004
Springer
In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that t...
CSL
2004
Springer
13 years 7 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional proce...