Efficient Symbolic Analysis for Optimizing Compilers
No abstract available.
Related papers
- Learning to Accelerate Symbolic Execution via Code Transformation ECOOP 2018
- Incremental Global Reoptimization of Programs TOPLAS 1992
- Using Integer Sets for Data-Parallel Program Analysis and Optimization PLDI 1998
- Symbolic Analysis for Parallelizing Compilers TOPLAS 1996
- Strided Difference Bound Matrices CAV 2024
- An efficient implementation of visibility in Ada PLDI 1984
- Enabling Spill-Free Compilation via Affine-Based Live Range Reduction Optimization CGO 2026
- Tensor Program Superoptimization through Cost-Guided Symbolic Program Synthesis CGO 2026