Formal verification of a generic framework to synthesize SAT-provers

Francisco -Jesús Martín-Mateos, José -Antonio Alonso, María -José Hidalgo, José -Luis Ruiz-Reina
2004 Journal of automated reasoning  
We present in this paper an application of the ACL2 system to generate and reason about propositional satisfiability provers. For that purpose, we develop a framework where we define a generic SAT-prover based on transformation rules, and we formalize this generic framework in the ACL2 logic, carrying out a formal proof of its termination, soundness and completeness. This generic framework can be instantiated to obtain a number of verified and executable SAT-provers in ACL2, and this can be
more » ... in an automated way. Three instantiations of the generic framework are considered: semantic tableaux, sequent and Davis-Putnam-Logeman-Loveland methods.
doi:10.1007/bf03177742 fatcat:kw6a66uco5faxntunbwxprzgpa