Chaff algorithm: Difference between revisions
correct template to use here |
|||
| Line 4: | Line 4: | ||
== Implementations == |
== Implementations == |
||
Some available implementations of the algorithm in software are mChaff and '''zChaff''', the latter one being the most widely known and used. zChaff was originally written by Dr. Lintao Zhang, {{clarify|reason=Since when?|date=April 2019}} at [[Microsoft Research]], hence the “z”. It is now maintained by researchers at [[Princeton University]] and available for [[download]] as both source code and binaries on [[Linux]]. zChaff is free for non-commercial use. |
Some available implementations of the algorithm in software are mChaff and '''zChaff''', the latter one being the most widely known and used. zChaff was originally written by Dr. Lintao Zhang, {{clarify span|now|reason=Since when?|date=April 2019}} at [[Microsoft Research]], hence the “z”. It is now maintained by researchers at [[Princeton University]] and available for [[download]] as both source code and binaries on [[Linux]]. zChaff is free for non-commercial use. |
||
== References == |
== References == |
||
Revision as of 08:08, 9 April 2019
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (July 2017) |
Chaff is an algorithm for solving instances of the Boolean satisfiability problem in programming. It was designed by researchers at Princeton University, United States. The algorithm is an instance of the DPLL algorithm with a number of enhancements for efficient implementation.
Implementations
Some available implementations of the algorithm in software are mChaff and zChaff, the latter one being the most widely known and used. zChaff was originally written by Dr. Lintao Zhang, now[clarify] at Microsoft Research, hence the “z”. It is now maintained by researchers at Princeton University and available for download as both source code and binaries on Linux. zChaff is free for non-commercial use.
References
- M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an Efficient SAT Solver, 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.
- Vizel, Y.; Weissenbacher, G.; Malik, S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. 103 (11). doi:10.1109/JPROC.2015.2455034.
External links
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |