A Verified Prover Based on Ordered Resolution

Abstract : The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampire, combines ordered resolution and equality reasoning. As a step towards verifying modern provers, we specify, using Isabelle/HOL, a purely functional first-order ordered resolution prover and establish its soundness and refutational completeness. Methodologically, we apply stepwise refinement to obtain, from an abstract nondeterministic specification, a verified de-terministic program, written in a subset of Isabelle/HOL from which we extract purely functional Standard ML code that constitutes a semidecision procedure for first-order logic.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01937141
Contributor : Jasmin Christian Blanchette <>
Submitted on : Tuesday, November 27, 2018 - 10:53:01 PM
Last modification on : Wednesday, April 3, 2019 - 1:23:15 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel. A Verified Prover Based on Ordered Resolution. CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2019, Cascais, Portugal. ⟨10.1145/3293880.3294100⟩. ⟨hal-01937141⟩

Share

Metrics

Record views

49

Files downloads

25