Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
Abstract elided by the publisher.
Related papers
- Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis OOPSLA 2023
- Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis ESOP 2020
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth POPL 2015
- Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth TOPLAS 2019
- Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers CC 2006
- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method CC 2008
- The Bounded Pathwidth of Control-Flow Graphs OOPSLA 2023
- An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis TOPLAS 1990