Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts
Abstract elided by the publisher.
Related papers
- Indexing the extended Dyck-CFL reachability for context-sensitive program analysis OOPSLA 2022
- The set constraint/CFL reachability connection in practice PLDI 2004
- Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification OOPSLA 2025
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis PLDI 2013
- Communication-avoiding parallel minimum cuts and connected components PPoPP 2018
- Context transformations for pointer analysis PLDI 2017
- Context-sensitive data-dependence analysis via linear conjunctive language reachability POPL 2017
- A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction ECOOP 2024