7 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.LO2025★ 1 cited
Exploiting Instantiations from Paramodulation Proofs in Isabelle/HOL
Lukas Bartl, Jasmin Blanchette, Tobias Nipkow
Metis is an ordered paramodulation prover built into the Isabelle/HOL proof assistant. It attempts to close the current goal using a given list of lemmas. Typically these lemmas ar…
cs.LO2022
A Verified Implementation of B+-Trees in Isabelle/HOL
Niels Mündler, Tobias Nipkow
In this paper we present the verification of an imperative implementation of the ubiquitous B+-tree data structure in the interactive theorem prover Isabelle/HOL. The implementatio…
cs.LO2019★ 7 cited
PML 2 : Integrated Program Verification in ML
Rodolphe Lepigre
We present the PML 2 language, which provides a uniform environment for programming, and for proving properties of programs in an ML-like setting. The language is Curry-style and c…