Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

The considerable mathematical knowledge encoded by the Flyspeck project is combined
with external automated theorem provers (ATPs) and machine-learning premise selection …

Smart premise selection is essential when using automated reasoning as a tool for large-
theory formal proof development. This work develops learning-based premise selection in …

We present an in-context learning agent for formal theorem-proving in environments like
Lean and Coq. Current state-of-the-art models for the problem are finetuned on environment …

Formally verified correctness is one of the most desirable properties of software systems. But
despite great progress made via interactive theorem provers, such as Coq, writing proof …

Interactive theorem provers have developed dramatically over the past four decades, from
primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its …

The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty
specifications and invalid conjectures using various testing strategies. The previous …

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 …

Formally verifying software correctness is a highly manual process. However, because
verification proof scripts often share structure, it is possible to learn from existing proof scripts …

We present a Network Address Translator (NAT) written in C and proven to be semantically
correct according to RFC 3022, as well as crash-free and memory-safe. There exists a lot of …