• Publications
  • Influence
GRASP-A new search algorithm for satisfiability
TLDR
Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
GRASP: A Search Algorithm for Propositional Satisfiability
TLDR
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
Solving QBF with counterexample guided refinement
TLDR
Experimental evaluation of the implemented prototypes shows that the CEGAR-driven solver outperforms existing solvers on a number of benchmark families and that the DPLL solver benefits from the additional type of learning. Expand
Conflict-Driven Clause Learning SAT Solvers
TLDR
Sophisticated power management features are implemented by the present invention independent from operating system control, and the operating system need not suspend processing of other threads to process sophisticated power management procedures. Expand
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
TLDR
This work proposes the application of different background theories and SMT solvers to the verification of embedded software written in ANSI-C in order to improve scalability and precision in a completely automatic way and shows that the ESBMC model checker can analyze larger problems than existing tools and substantially reduce the verification time. Expand
Fast, flexible MUS enumeration
TLDR
This paper unifies and expands upon the earlier work, presenting a detailed explanation of the algorithm’s operation in a framework that also enables clearer comparisons to previous approaches, and presenting a new optimization ofThe algorithm as well. Expand
Solving QBF by Clause Selection
TLDR
A novel QBF algorithm is developed, which generalizes the concept of enumeration of implicit hitting sets and is competitive with, and often outperforms, the state of the art in QBF solving. Expand
Algorithms for Weighted Boolean Optimization
TLDR
Weighted Boolean Optimization (WBO) is proposed, a new unified framework that aggregates and extends PBO and MaxSAT and a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiable algorithms for MaxSat. Expand
Expansion-based QBF solving versus Q-resolution
This article introduces and studies a proof system ?Exp+Res that enables us to refute quantified Boolean formulas (QBFs). The system ?Exp+Res operates in two stages: it expands all universalExpand
On Computing Minimal Correction Subsets
TLDR
A number of novel techniques for improving the performance of existing MCS computation algorithms are developed and a novel algorithm is proposed for computing MCSes, which is shown to yield the most efficient and robust solutions for M CS computation. Expand
...
1
2
3
4
5
...