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.
Type de document :
Communication dans un congrès
CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2019, Cascais, Portugal. CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs. 〈10.1145/3293880.3294100〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01937141
Contributeur : Jasmin Christian Blanchette <>
Soumis le : mardi 27 novembre 2018 - 22:53:01
Dernière modification le : lundi 3 décembre 2018 - 14:55:58

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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. CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs. 〈10.1145/3293880.3294100〉. 〈hal-01937141〉

Partager

Métriques

Consultations de la notice

24

Téléchargements de fichiers

7