Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

Recent years have seen great advances towards verifying large-scale systems code.
However, these verifications are usually based on hand-written assembly or machine-code …

Rewrite rules are critical in equality saturation, an increasingly popular technique in
optimizing compilers, synthesizers, and verifiers. Unfortunately, develo** high-quality …

We describe the first approach to automatically synthesizing heap-manipulating programs
with auxiliary recursive procedures. Such procedures occur routinely in data structure …

In this paper we introduce a new approach for proving quantified theorems over inductively
defined data-types. We present an automated prover that searches for a sequence of …

This research idea paper proposes leveraging Large Language Models (LLMs) to enhance
the productivity of Dafny developers. Although the use of verification-aware languages, such …

The problem of automatically proving the equality of terms over recursive functions and
inductive data types is challenging, as such proofs often require auxiliary lemmas which …

Cyclic proof systems, in which induction is managed implicitly, are a promising approach to
automatic verification. The soundness of cyclic proof graphs is ensured by checking them …

We develop a doubly exponential decision procedure for the satisfiability problem of
guarded separation logic—a novel fragment of separation logic featuring user-supplied …

Symbolic-heap separation logic with inductive definitions is a popular formalism for
reasoning about heap-manipulating programs. The fragment SLIDbtw introduced by Iosif …