Boosting Compiler Testing by Injecting Real-World Code

SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories

Reducing Static Analysis Unsoundness with Approximate Interpretation

Compilation of Modular and General Sparse Workspaces

A Lightweight Polyglot Code Transformation Language

SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques