References

  1. Tomás Balyo, Marijn J. H. Heule & Matti Järvisalo (2017): SAT Competition 2016: Recent Developments. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pp. 5061–5063.
  2. Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich & Christoph Weidenbach (2018): A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. J. Autom. Reasoning 61(1-4), pp. 333–365, doi:10.1007/s10817-018-9455-7.
  3. Robert Brummayer, Florian Lonsing & Armin Biere (2010): Automated Testing and Debugging of SAT and QBF Solvers. In: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 44–57, doi:10.1007/978-3-642-14186-7_6.
  4. David R. Cok, David Déharbe & Tjark Weber (2014): The 2014 SMT Competition. JSAT 9, pp. 207–242.
  5. Mathias Fleury (2019): Optimizing a Verified SAT Solver. In: NASA Formal Methods - 11th International Symposium, NFM 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, pp. 148–165, doi:10.1007/978-3-030-20652-9_10.
  6. Richard L. Ford & K. Rustan M. Leino (2017): Dafny Reference Manual.
  7. Carla P. Gomes, Henry A. Kautz, Ashish Sabharwal & Bart Selman (2008): Satisfiability Solvers. In: Handbook of Knowledge Representation. Elsevier, pp. 89–134, doi:10.1016/S1574-6526(07)03002-7.
  8. Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch & Simon Winwood (2009): seL4: formal verification of an OS kernel. In: Proceedings of the 22nd ACM Symposium on Operating Systems Principles 2009, SOSP 2009, Big Sky, Montana, USA, October 11-14, 2009, pp. 207–220, doi:10.1145/1629575.1629596.
  9. Xavier Leroy (2009): Formal verification of a realistic compiler. Commun. ACM 52(7), pp. 107–115, doi:10.1145/1538788.1538814.
  10. Stephane Lescuyer (2011): Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq. Theses. Université Paris Sud - Paris XI.
  11. Filip Mari\'c (2009): Formalization and Implementation of Modern SAT Solvers. J. Autom. Reasoning 43(1), pp. 81–119, doi:10.1007/s10817-009-9127-8.
  12. Duckki Oe, Aaron Stump, Corey Oliver & Kevin Clancy (2012): versat: A Verified Modern SAT Solver. In: Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings, pp. 363–378, doi:10.1007/978-3-642-27940-9_24.
  13. Natarajan Shankar & Marc Vaucher (2011): The Mechanical Verification of a DPLL-Based Satisfiability Solver. Electr. Notes Theor. Comput. Sci. 269, pp. 3–17, doi:10.1016/j.entcs.2011.03.002.
  14. Geoff Sutcliffe (2018): The 9th IJCAR Automated Theorem Proving System Competition - CASC-J9. AI Commun. 31(6), pp. 495–507, doi:10.3233/AIC-180773.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org