Despite the plausible necessity of topological protection for realizing scalable quantum
computers, the conceptual underpinnings of topological quantum logic gates had arguably …

Formally verifying system properties is one of the most effective ways of improving system
quality, but its high manual effort requirements often render it prohibitively expensive. Tools …

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 …

We report on our efforts building a new, large proof-repair dataset and benchmark suite for
the Coq proof assistant. The dataset is made up of Git commits from open-source projects …

The days of verifying only toy programs are long gone. The last two decades have marked a
new era of verification at scale, bringing strong guarantees to large and critical systems—an …

This paper investigates the ability of transformer-based models to learn structural recursion
from examples. Recursion is a universal concept in both natural and formal languages …

With the growing practice of mechanizing language metatheories, it has become ever more
pressing that interactive theorem provers make it easy to write reusable, extensible code …

The cost of maintaining formally specified and verified software is widely considered
prohibitively high due to the need to constantly keep code and the proofs of its correctness in …

Formal verification is an effective but extremely work-intensive method of improving software
quality. Verifying the correctness of software systems often requires significantly more effort …