Formalization and implementation of modern SAT solvers

Journal of Automated Reasoning

Volumn 43, Issue 1, 2009, Pages 81-119

  Marić, Filip ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Algorithms; Data structures; DPLL; SAT solving; Software verification

Indexed keywords

CORRECTNESS ARGUMENT; CORRECTNESS PROOFS; DPLL; DPLL PROCEDURE; EFFICIENT IMPLEMENTATION; EXTENDED VERSIONS; HOARE LOGIC; ISABELLE; PROGRAMMING LANGUAGE; PSEUDO-CODE; SAT SOLVERS; SAT SOLVING; SOFTWARE VERIFICATION; STATE TRANSITION SYSTEMS; STEP-BY-STEP; THEOREM PROVING SYSTEMS; TOPDOWN;

ABSTRACTING; ALGORITHMS; DATA STRUCTURES; DECISION THEORY; HIGH LEVEL LANGUAGES; THEOREM PROVING; VERIFICATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 67349214941     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-009-9127-8     Document Type: Article

References (30)

1. Barrett, C.: Checking validity of quantifier-free formulas in combinations of first-order theories. Ph.D. thesis, Stanford University (2003)
2. A Biere 2008 PicoSAT essentials JSAT 4 75 97
3. Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: a comparative survey. ACM Comput. Surv. 38(4) (2006) (Pubitemid 46043272)
4. P Beame H Kautz A Sabharwal 2004 Towards understanding and harnessing the potential of clause learning JAIR 22 319 351
5. Baptista, L., Marques-Silva, J.P.: Using randomization and learning to solve hard real-world instances of satisfiability. In: CP '00. LNCS 1894, pp. 489-494, Singapore, 18-22 September 2000
6. Bayardo, R.J. Jr., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: 14th AAAI, pp. 203-208, Providence, 27-31 July 1997
7. Cook, S.A.: The complexity of theorem-proving procedures. In: 3rd STOC, pp. 151-158. ACM, New York (1971)
8. M Davis G Logemann D Loveland 1962 A machine program for theorem-proving Commun. ACM 5 7 394 397
9. M Davis H Putnam 1960 A computing procedure for quantification theory J. ACM 7 3 201 215
10. Een, N., Sorensson, N.: An extensible SAT solver. In: Ligure, S.M. (ed.) SAT '03. LNCS 2919, pp. 502-518. Springer, New York (2003)
11. Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: Handbook of Knowledge Representation. Elsevier, Amsterdam (2007)
12. Goldberg, E., Novikov, Y.: Berkmin: a rast and robust SAT solver. In: DATE'02, pp. 142-149. Paris (2002)
13. Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: 15th AAAI, pp. 431-437, Madison, 26-30 July 1998
14. CAR Hoare 1969 An axiomatic basis for computer programming Commun. ACM 12 10 576 580
15. Huang, J.: A case for simple SAT solvers. In: CP '07. LNCS 4741, pp. 839-846, Providence, September 2007
16. Huang, J.: The effect of restarts on the efficiency of clause learning. In: IJCAI '07, pp. 2318-2323, Hyderabad, 6-12 January 2007
17. Krstić, S., Goel, A.: Architecting solvers for SAT modulo theories: Nelson-Oppen with DPLL. In: FroCos '07. LNCS 4720, pp. 1-27, Liverpool, 10-12 September 2007
18. Marić, F.: SAT solver verification. The archive of formal proofs. http://afp.sf.net/entries/SATSolverVerification.shtml (2008)
19. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC '01, pp. 530-535, Las Vegas, 18-22 June 2001
20. Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability algorithms. In: EPIA '99. LNCS 1695, pp. 62-74, Évora, September 1999
21. JP Marques-Silva KA Sakallah 1999 Grasp: a search algorithm for propositional satisfiability IEEE Trans. Comput. 48 5 506 521
22. R Nieuwenhuis A Oliveras C Tinelli 2006 Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T) J. ACM 53 6 937 977 (Pubitemid 46276962)
23. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL-A Proof Assistant for Higher-Order Logic, LNCS 2283. Springer, New York (2002)
24. Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: SAT '07. LNCS 4501, pp. 294-299, Lisbon, May 2007
25. Marques Silva, J.P., Sakallah, K.A.: Conflict analysis in search algorithms for satisfiability. In: 8th ICTAI, pp. 467-469, Toulouse, 16-19 November 1996
26. Wiedijk, F.: Comparing mathematical provers. In: MKM 03. LNCS 2594, pp. 188-202, Bertinoro, February 2003 (Pubitemid 36242327)
27. Zhang, H.: SATO: an efficient propositional prover. In: CADE-14. LNCS 1249, pp. 272-275, Townsville (1997) (Pubitemid 127089531)
28. Zhang, L., Malik, S.: The quest for efficient Boolean satisfiability solvers. In: CAV '02. LNCS 2404, pp. 17-36, Copenhagen (2002)
29. Zhang, L., Malik, S.: Validating SAT solvers using independent resolution-based checker. In: DATE '03, pp. 10880-10885, Münich (2003)
30. Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: ICCAD '01, pp. 279-285, San Jose (2001)