Pointer analysis is a core component of program-analysis frameworks. Inclusion-based solvers repeatedly update points-to sets, and the resulting set operations frequently dominate end-to-end runtime. In existing sparse bit-vector representations, we find that the main cost is not bitmap arithmetic but irregular index m...
Zhao-Yang Tan, Pei-Sen Yao, Kui Ren· Proceedings of the 41st IEEE...· 0 citations
This work presents two new algorithms for bit-vector programs: a strategically guided linear search that exploits the lattice structure and a bitwise greedy approach that resolves bound bits from high to low with a solver-call count linear in bit-width.
Hanrui Zuo, Pei-Sen Yao, Kui Ren· arXiv.org· 0 citations
This paper explores a new perspective: applying semantic-preserving compiler optimizations directly to intermediate representation (IR) before pointer analysis, which is modular, analysis-agnostic, and easily integrates with existing tools.
Zi-Nan Gu, Pei-Sen Yao, Kui Ren· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.