201 search results - page 7 / 41 » Using a SAT solver to generate checking sequences |
145
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
153
click to vote
CPAIOR
2007
Springer
15 years 12 months ago
2007
Springer
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
120
Voted
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
168
Voted
SAT
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
146
Voted
CP
2007
Springer
15 years 12 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...