Formally verifying software is a highly desirable but labor-intensive task. Recent work has
developed methods to automate formal verification using proof assistants, such as Coq and …

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 …

Neural networks have in recent years shown promise for helping software engineers write
programs and even formally verify them. While semantic information plays a crucial part in …

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 …

Increasing demand on computer networks continuously pushes manufacturers to
incorporate novel features and capabilities into their switches at an ever-accelerating pace …

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 …

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 …

We formalise the proof of the first case of Fermat's Last Theorem for regular primes using
the\emph {Lean} theorem prover and its mathematical library\emph {mathlib}. This is an …

Pip-MPU is a minimalist separation kernel for constrained devices (scarce memory and
power resources). In this work, we demonstrate high-assurance of Pip-MPU's isolation …