Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be …

Cryptographic tools like proof systems, multi-party computation, and fully homomorphic
encryption are usually applied to computations expressed as systems of arithmetic …

The runtimes of certain floating-point instructions can vary up to two orders of magnitude
with instruction operands, allowing attackers to break security and privacy guarantees of real …

This paper considers the correctness of domain-specific compilers for tensor programming
languages through the study of Halide, a popular representative. It describes a translation …

We investigate the use of coverage-guided fuzzing as a means of proving satisfiability of
SMT formulas over finite variable domains, with specific application to floating-point …

We present VeRA, a system for verifying the range analysis pass in browser just-in-time (JIT)
compilers. Browser developers write range analysis routines in a subset of C++, and …

SMT solvers are fundamental tools for reasoning about constraints in practical problems like
symbolic execution and program synthesis. Faster SMT solving can improve the …

Symbolic execution is a well-known program analysis technique for testing software, which
makes intensive use of constraint solvers. Recent support for floating-point constraint solving …

We present JOG, a framework that facilitates developing Java JIT peephole optimizations
alongside JIT tests. JOG enables developers to write a pattern, in Java itself, that specifies …

Peephole optimizations are a common source of compiler bugs. Compiler developers
typically transform an incorrect peephole optimization into a valid one by strengthening the …