We designed, implemented, and deployed Alive2: a bounded translation validation tool for
the LLVM compiler's intermediate representation (IR). It limits resource consumption by, for …

We show how some classical static analyses for imperative programs, and the optimizing
transformations which they enable, may be expressed and proved correct using elementary …

Near-term quantum computers are expected to work in an environment where each
operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied …

There is a significant body of work devoted to testing, verifying, and certifying the correctness
of optimizing compilers. The focus of such work is to determine if source code and optimized …

Large language models (LLMs) are a new and powerful tool for a wide span of applications
involving natural language and demonstrate impressive code generation abilities. The goal …

Translation validation is a technique for checking that, after an optimization has run, the
input and output of the optimization are equivalent. Traditionally, translation validation has …

Decision procedures for checking satisfiability of logical formulas are crucial for many
verification applications (eg,[2, 6, 3]). Of particular recent interest are solvers for Satisfiability …

High level data structures are a cornerstone of modern programming and at the same time
stand in the way of compiler optimizations. In order to reason about user-or library-defined …

Abstract Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover
convinces a verifier of the truth of a statement without revealing any other information …

We present Rhodium, a new language for writing compiler optimizations that can be
automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses …