Verification in ACL2 of a generic framework to synthesize SAT-provers

Authors:
F. J. Martín-Mateos;J. A. Alonso;M. J. Hidalgo;J. L. Ruiz-Reina
Affiliations:
Departamento de Ciencias de la Computación e Inteligencia Artificial, Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain;Departamento de Ciencias de la Computación e Inteligencia Artificial, Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain;Departamento de Ciencias de la Computación e Inteligencia Artificial, Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain;Departamento de Ciencias de la Computación e Inteligencia Artificial, Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Sevilla, Spain
Venue:
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Year:
2002

Citing 8
Cited 0

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
First-order logic and automated theorem proving

First-order logic and automated theorem proving
Completeness of resolution revisited

Theoretical Computer Science
Reductions for non-clausal theorem proving

Theoretical Computer Science
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
Proving termination with Multiset Orderings

Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Decidability extracted: synthesizing "correct-by-construction" decision procedures from constructive proofs

Decidability extracted: synthesizing "correct-by-construction" decision procedures from constructive proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that purpose, we present a framework where we define a generic transformation based SAT-prover, and we show how this generic framework can be formalized in the ACL2 logic, making 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 done in an automatized way. Three case studies are considered: semantic tableaux, sequent and Davis-Putnam methods.