201 search results - page 21 / 41 » Using a SAT solver to generate checking sequences |
163
click to vote
CAEPIA
2005
Springer
15 years 11 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
153
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
139
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
142
click to vote
DAC
2007
ACM
16 years 6 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
172
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...