• 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 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
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
TLDR
This paper describes a relationship between satisfiable and unsatisfiable subsets of constraints that is subsequently used as the foundation for MUS extraction algorithms, implemented for Boolean satisfiability constraints. Expand
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further uses are complicated byExpand
Solving difficult SAT instances in the presence of symmetry
TLDR
An improved construction of symmetry-breaking clauses is proposed and applied to achieve significant speed-ups over current state-of-the-art in Boolean satisfiability and it is shown that in structured SAT instances difficulty may be associated with large numbers of symmetries. Expand
Generating Data Race Witnesses by an SMT-Based Analysis
TLDR
An algorithm for generating debugging aid information called witnesses, which are concrete thread schedules that can deterministically trigger the data races, is proposed and precisely encodes the sequential consistency semantics using a scalable predictive model to ensure that the reported witness is always feasible. Expand
On Finding All Minimally Unsatisfiable Subformulas
TLDR
A novel technique is developed for extracting all MUSes of a CNF formula, tightly integrat ing the authors' implementation with a modern SAT solver and discussing ways in which ideas from both could be combined to improve further. Expand
AMUSE: a minimally-unsatisfiable subformula extractor
TLDR
This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula that adapts the "learning process" of a modern SAT solver to identify unsatisfiableSubformulas rather than search for satisfying assignments. Expand
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
TLDR
A new hybrid method for efficiently integrating Pseudo-Boolean constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems is introduced, which benefits significantly from the pruning power of the learned PB constraints, while keeping the overhead of adding them into the problem low. Expand
...
1
2
3
4
5
...