115 search results - page 4 / 23 » : Compiling problem specifications into SAT |
123
click to vote
CPAIOR
2010
Springer
14 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
ENTCS
2008
14 years 9 months ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
FM
2008
Springer
14 years 11 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
ICCAD
2002
IEEE
15 years 6 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...
ENTCS
2006
14 years 9 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...