A modular Isabelle framework for verifying saturation provers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

A modular Isabelle framework for verifying saturation provers

Abstract

We present a formalization in Isabelle/HOL of a comprehensive framework for proving the completeness of automatic theorem provers based on resolution, superposition, or other saturation calculi. The framework helps calculus designers and prover developers derive, from the completeness of a calculus, the completeness of prover architectures implementing the calculus. It also helps derive the completeness of calculi obtained by lifting ground (i.e., variable-free) calculi. As a case study, we re-verified Bachmair and Ganzinger's resolution prover RP to show the benefits of modularity.
Fichier principal
Vignette du fichier
satur_isa_paper.pdf (818.1 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03364015 , version 1 (04-10-2021)

Identifiers

Cite

Sophie Tourret, Jasmin Blanchette. A modular Isabelle framework for verifying saturation provers. CPP 2021 - 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2021, Virtual, Denmark. pp.224-237, ⟨10.1145/3437992.3439912⟩. ⟨hal-03364015⟩
37 View
31 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More