We introduce equivalence modulo inputs (EMI), a simple, widely applicable methodology for
validating optimizing compilers. Our key insight is to exploit the close interplay between (1) …

Compiler testing is important and challenging. Equivalence Modulo Inputs (EMI) is a recent
promising approach for compiler validation. It is based on mutating the unexecuted …

CompCert is the first commercially available optimizing compiler that is formally verified,
using machine-assisted mathematical proofs, to be exempt from mis-compilation. The …

Timing side-channels are arguably one of the main sources of vulnerabilities in
cryptographic implementations. One effective mitigation against timing side-channels is to …

Validating optimizing compilers is challenging because it is hard to generate valid test
programs (ie, those that do not expose any undefined behavior). Equivalence Modulo Inputs …

We present Low*, a language for low-level programming and verification, and its application
to high-assurance optimized cryptographic libraries. Low* is a shallow embedding of a …

Compilers should not miscompile. Our work addresses problems in developing peephole
optimizations that perform local rewriting to improve the efficiency of LLVM code. These …

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 …

Information flow analyses traditionally use the Program Dependence Graph (PDG) as a
supporting data-structure. This graph relies on Ferrante et al.'s notion of control …

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 …