zChaff is an implementation of the well known CHAFF, an algorithm for solving satisfiability (SAT) problems. It won the Best Complete Solver in both industrial and handmade benchmark categories in the SAT 2002 Competition, and the Best Complete Solver in the industrial benchmark in the SAT 2004 Competition. It is a popular solver and can be compiled into a linkable library for easy integration with user applications.

References in zbMATH (referenced in 21 articles , 1 standard article )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Armand, Michael; Faure, Germain; Grégoire, Benjamin; Keller, Chantal; Théry, Laurent; Werner, Benjamin: A modular integration of SAT/SMT solvers to Coq through proof witnesses (2011)
  2. Shilov, N.V.; Bodin, E.V.; Shilova, S.O.: Guided tour inside F@BOOL@: a case-study for a SAT-based verifying compiler (2010)
  3. Weber, Tjark; Amjad, Hasan: Efficiently checking propositional refutations in HOL theorem provers (2009)
  4. Yadgar, Avi; Grumberg, Orna; Schuster, Assaf: Hybrid BDD and All-SAT method for model checking (2009)
  5. Bruni, Renato; Santori, Andrea: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (2008)
  6. Jing, Minge; Zhou, Dian; Tang, Pushan; Zhou, Xiaofang; Zhang, Hua: Solving SAT problem by heuristic polarity decision-making algorithm (2007)
  7. Bailleux, Olivier; Boufkhad, Yacine; Roussel, Olivier: A translation of pseudo-Boolean constraints to SAT (2006)
  8. Drechsler, Rolf; Fey, Görschwin: Automatic test pattern generation (2006)
  9. Fu, Zhaohui; Malik, Sharad: On solving the partial MAX-SAT problem (2006)
  10. Dershowitz, Nachum; Hanna, Ziyad; Nadel, Alexander: A clause-based heuristic for SAT solvers (2005)
  11. Jia, Haixia; Moore, Cris; Selman, Bart: From spin glasses to hard satisfiable formulas (2005)
  12. Le Berre, Daniel; Simon, Laurent: Fifty-five solvers in Vancouver: The SAT 2004 competition (2005)
  13. Lewis, Matthew D.T.; Schubert, Tobias; Becker, Bernd W.: Speedup techniques utilized in modern SAT solvers -- an analysis in the MIRA environment. (2005)
  14. Mahajan, Yogesh S.; Fu, Zhaohui; Malik, Sharad: Zchaff2004: An efficient SAT solver (2005)
  15. Manolios, Panagiotis; Srinivasan, Sudarshan K.: A parameterized benchmark suite of hard pipelined-machine-Verification problems (2005)
  16. Pan, Guoqiang; Vardi, Moshe Y.: Search vs. symbolic techniques in satisfiability solving (2005)
  17. Pan, Guoqiang; Vardi, Moshe Y.: Symbolic techniques in satisfiability solving (2005)
  18. D’Antonio, Massimo; Delzanno, Giorgio: SAT-based analysis of cellular automata (2004)
  19. Franco, John; Kouril, Michal; Schlipf, John; Ward, Jeffrey; Weaver, Sean; Dransfield, Michael; Vanfleet, W.Mark: SBSAT: a state-based, BDD-based satisfiability solver (2004)
  20. Ansótegui, Carlos: A new approach to solving SAT-encoded binary CSPs (2003) ioport

1 2 next