610 search results - page 82 / 122 » Using SAT in QBF |
132
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
148
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
158
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
148
click to vote
GPCE
2007
Springer
15 years 10 months ago
2007
Springer
Programs of a software product line can be synthesized by composing modules that implement features. Besides high-level domain constraints that govern the compatibility of feature...
124
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
An analysis for the phase transition in a random NK landscape model is given. For the fixed ratio model, NK(n, k, z), Gao and Culberson [17] showed that a random instance generat...