The CakeML compiler is, to the best of our knowledge, the most realistic verified compiler for
a functional programming language to date. The architecture of the compiler, a sequence of …

We have developed and mechanically verified a new compiler backend for CakeML. Our
new compiler features a sequence of intermediate languages that allows it to incrementally …

ZGC is a modern, non-generational, region-based, mostly concurrent, parallel, mark-
evacuate collector recently added to OpenJDK. It aims at having GC pauses that do not grow …

OCaml is an industrial-strength, multi-paradigm programming language, widely used in
industry and academia. OCaml is also one of the few modern managed system …

Serializability is a well-understood correctness criterion that simplifies reasoning about the
behavior of concurrent transactions by ensuring they are isolated from each other while they …

We develop powerful and general techniques to mechanically verify realistic programs that
manipulate heap-represented graphs. These graphs can exhibit well-known organization …

This paper presents the verification of a generational copying garbage collector for the
CakeML runtime system. The proof is split into an algorithm proof and an implementation …

Worst-case execution time (WCET) analysis of real-time code needs to be performed on the
executable binary code for soundness. Obtaining tight WCET bounds requires determination …

Garbage collectors provide memory safety, an important step toward program correctness.
However, correctness of the collector itself can be challenging to establish, given both the …

We present a simple yet scalable framework for formal reasoning and machine-assisted
proof of interrupt-driven concurrency in operating-system code, and use it to prove the …