- Analysis of Search Based Algorithms for Satisfiability
of Quantified Boolean Formulas Arising from Circuit State Space
Diameter Problems, by D. Tang, Y. Yu, D. Ranjan, and S. Malik,
Proceedings of the Seventh International Conference on Theory and
Applications of Satisfiability Testing (SAT2004), Vancouver, BC, Canada, May 2004
- A Comparative Study of 2QBF Algorithms, by D. Ranjan, D. Tang and S. Malik,
Proceedings of the Seventh International Conference on Theory and
Applications of Satisfiability Testing (SAT2004), Vancouver, BC, Canada, May 2004
- Validating SAT Solvers Using an Independent
Resolution-Based Checker: Practical Implementations and Other
Applications, by L. Zhang and S. Malik, DATE2003, Munich, Germany, March 2003
- Conflict Driven Learning in a Quantified
Boolean Satisfiability Solver, by L. Zhang and S. Malik, Proceedings of International Conference
on Computer Aided Design (ICCAD2002), San Jose, CA, Nov. 2002.
- Towards Symmetric Treatment of Conflicts And
Satisfaction in Quantified Boolean Satisfiability Solver ,by L. Zhang and S. Malik, Proceedings
of 8th International Conference on Principles and Practice of
Constraint Programming (CP2002). Ithaca, NY, Sept. 2002.
- The Quest for Efficient Boolean
Satisfiability Solvers, by L. Zhang and S. Malik, Invited Paper, Proceedings of 8th International
Conference on Computer Aided Deduction (CADE 2002) and also in
Proceedings of 14th Conference on Computer Aided Verification (CAV2002),
Copenhagen, Denmark, July 2002
- Efficient
Conflict Driven Learning in a Boolean Satisfiability
Solver by L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Proceedings of ICCAD 2001,
San Jose, CA, Nov. 2001.
- Chaff: Engineering an
Efficient SAT Solver by M. Moskewicz, C. Madigan,
Y. Zhao, L. Zhang, S. Malik, 39th Design Automation Conference (DAC 2001), Las Vegas, June 2001.
|