An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
Abstract elided by the publisher.
Related papers
- 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
- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization ESOP 2017
- The Fine-Grained Complexity of CFL Reachability POPL 2023
- Efficient algorithms for dynamic bidirected Dyck-reachability POPL 2022
- Taming transitive redundancy for context-free language reachability OOPSLA 2022
- Subcubic certificates for CFL reachability POPL 2022