All-SAT Using Minimal Blocking Clauses.
Proceedings of the 2014 27th International Conference on VLSI Design, 2014
Exploiting Circuit Reconvergence through Static Learning in CNF SAT Solvers.
Proceedings of the 21st International Conference on VLSI Design (VLSI Design 2008), 2008
Lemma Learning in SMT on Linear Constraints.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
Considering Circuit Observability Don't Cares in CNF Satisfiability.
Proceedings of the 2005 Design, 2005
Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004
Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.
Proceedings of the SAT 2004, 2004
Minimizing the Number of Programming Steps for Diagnosis of Interconnect Faults in FPGAs.
Proceedings of the 8th Asian Test Symposium (ATS '99), 1999
Diagnosing Single Faults for Interconnects in SRAM Based FPGAs.
Proceedings of the 1999 Conference on Asia South Pacific Design Automation, 1999
A Diagnosis Method for Interconnects in SRAM Based FPGAs.
Proceedings of the 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, 1998