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

Explore a groundbreaking 17-minute conference talk from POPL 2024 that introduces a novel dynamic algorithm for bidirected Dyck reachability in on-the-fly static analysis. Delve into the challenges of continuous code changes in program analysis and discover how this algorithm achieves O(n· α(n)) worst-case performance per update, outperforming the O(n2) bound of offline algorithms. Learn about the algorithm's implementation and its impressive performance in on-the-fly data-dependence and alias analyses, showcasing speedups of up to 1000X compared to existing methods. Gain insights into the practical applications of this approach for real-time program analysis and its potential to revolutionize the field of static analysis.

[POPL'24] On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability