A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas | 20 | 0.93 | 2009 |
Principles of sequential-equivalence verification | 11 | 0.78 | 2005 |
A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas | 36 | 1.52 | 2005 |
Preserving synchronizing sequences of sequential circuits after retiming | 4 | 0.43 | 2004 |
AMUSE: a minimally-unsatisfiable subformula extractor | 63 | 2.53 | 2004 |
SAT-based sequential depth computation | 16 | 0.93 | 2003 |
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution | 34 | 1.67 | 2003 |
Search-based SAT using zero-suppressed BDDs | 0 | 0.34 | 2002 |
ZBDD-Based Backtrack Search SAT Solver | 13 | 0.77 | 2002 |
Scalable hybrid verification of complex microprocessors | 14 | 1.08 | 2001 |
Microprocessor Simulation and Program Assembling Using Spreadsheets | 1 | 0.37 | 2000 |