Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization
Abstract elided by the publisher.
Related papers
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees ESOP 2009
- Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks POPL 2015
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis PLDI 2013
- Indexing the extended Dyck-CFL reachability for context-sensitive program analysis OOPSLA 2022
- The set constraint/CFL reachability connection in practice PLDI 2004
- The Fine-Grained Complexity of CFL Reachability POPL 2023
- Field-Sensitive Over-Tainting Reduction in IFDS Taint Analysis via CFL-Reachability ECOOP 2026
- Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming POPL 2023