Unbounded superoptimization
Abstract
Our aim is to enable software to take full advantage of the capabilities of emerging microprocessor designs without modifying the compiler.
Related papers
- Eliminating Branches using a Superoptimizer and the GNU C Compiler PLDI 1992
- GreenThumb: superoptimizer construction framework CC 2016
- Minotaur: A SIMD-Oriented Synthesizing Superoptimizer OOPSLA 2024
- Denali: A Goal-directed Superoptimizer PLDI 2002
- Conditionally correct superoptimization OOPSLA 2015
- SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques PLDI 2024
- A Max-SMT Superoptimizer for EVM handling Memory and Storage TACAS 2022
- Dataflow-based pruning for speeding up superoptimization OOPSLA 2020