428 search results - page 20 / 86 » FPGA-Based SAT Solver |
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
JSAT
2010
13 years 2 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
ISCIS
2009
Springer
14 years 2 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
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; (...
STTT
2008
13 years 7 months ago
2008
Abstract. Managing access control policies in modern computer systems can be challenging and error-prone. Combining multiple disparate access policies can introduce unintended cons...