We present Aeneas, a new verification toolchain for Rust programs based on a lightweight
functional translation. We leverage Rust's rich region-based type system to eliminate …

Verified compilation of open modules (ie, modules whose functionality depends on other
modules) provides a foundation for end-to-end verification of modular programs ubiquitous …

This paper presents a specification framework for monadic, recursive, interactive programs
that supports auto-active verification, an approach that combines user-provided guidance …

Deductive verification tools can prove a large range of program properties, but often face
issues on recursive data structures. Abstract interpretation tools based on separation logic …

While formal verification promises correctness guarantees about software, these guarantees
themselves must be verified. This dissertation focuses on the soundness of the Heapster …

Interaction Trees are a recently developed form of denotational semantics for effectful
programs that is executable and compositional. This dissertation uses Interaction Trees to …

Interaction trees are a representation of effectful and reactive systemsdesigned to be
implemented in a proof assistant such as Coq. They are equipped with a rich algebra of …