Faster Alias Set Analysis Using Summaries
No abstract available.
Related papers
- Efficient subcubic alias analysis for C OOPSLA 2014
- On-demand dynamic summary-based points-to analysis CGO 2012
- Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis ESOP 2020
- PIP: Making Andersen's Points-to Analysis Sound and Practical for Incomplete C Programs CGO 2026
- IDEal: efficient and precise alias-aware dataflow analysis OOPSLA 2017
- Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic SAS 2017
- Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth TOPLAS 2019
- Scalable and Modular Robustness Analysis of Deep Neural Networks APLAS 2021