We developed a formal framework for conflict-driven clause learning (CDCL) using the
Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL calculus is …

We present Aesop, a proof search tactic for the Lean 4 interactive theorem prover. Aesop
performs a tree-based search over a user-specified set of proof rules. It supports safe and …

IsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at developing formal
theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart …

Simulation and formal verification are important complementary techniques necessary in
high assurance model-based systems development. In order to support coherent results, it is …

I present a formalization in Isabelle/HOL of the resolution calculus for first-order logic with
formal soundness and completeness proofs. To prove the calculus sound, I use the …

We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger's
chapter on resolution theorem proving, culminating with a refutationally complete first-order …

Classical first-order logic is in many ways central to work in mathematics, linguistics,
computer science and artificial intelligence, so it is worthwhile to define it in full detail. We …

We formalize in Isabelle/HOL soundness and completeness of a one-sided sequent calculus
for first-order logic. The completeness is shown via a translation from a semantic tableau …

Model execution allows us to prototype and analyse software engineering models by
stepping through their possible behaviours, using techniques like animation and simulation …

We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order
prover with equality. The LCF-style prover is a translation we have made, to Standard ML, of …