On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability

• Published in: Proceedings of ACM on programming languages Vol. 8; no. POPL; pp. 1239 - 1268
• Main Authors: Krishna, Shankaranarayanan, Lal, Aniket, Pavlogiannis, Andreas, Tuppe, Omkar
• Format: Journal Article
• Language: English
• Published: New York, NY, USA ACM 02.01.2024
• Subjects: Program analysis; Software and its engineering; Software verification and validation; Theory and algorithms for application domains; Theory of computation; static analysis; dynamic algorithms; CFL reachability

Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are usual formalisms of demand-driven points-to and alias analyses. The best (offline) algorithm runs in O(m+n · α(n)) time, w...