Cerca
Ara es mostren els items 1-3 de 3
Decision levels are stable: towards better SAT heuristics
(EasyChair Publications, 2020)
Text en actes de congrés.
Accés restringit per política de l'editorial
Text en actes de congrés.
Accés restringit per política de l'editorial
We shed new light on the Literal Block Distance (LBD) and glue-based heuristics used in current SAT solvers. For this, we first introduce the concept of stickiness: given a run of a CDCL SAT solver, for each pair of literals ...
Proving non-termination using max-SMT
(Springer, 2014)
Text en actes de congrés.
Accés obert
Text en actes de congrés.
Accés obert
We show how Max-SMT-based invariant generation can be exploited for proving non-termination of programs. The construction of the proof of non-termination is guided by the generation of quasi-invariants - properties such ...
Minimal-model-guided approaches to solving polynomial constraints and extensions
(Springer, 2014)
Text en actes de congrés.
Accés obert
Text en actes de congrés.
Accés obert
In this paper we present new methods for deciding the satisfiability of formulas involving integer polynomial constraints. In previous work we proposed to solve SMT(NIA) problems by reducing them to SMT(LIA): non-linear ...