Interprocedural side-effect analysis in linear time
Keith D. Cooper, Ken Kennedy · ACM SIGPLAN Notices · 2004
We present a new method for solving Banning's alias-free flow-insensitive side-effect analysis problem. The algorithm employs a new data structure, called the binding multi-graph , along with depth-first search to achieve a running time that is linear in the size of the call multi-graph of the program. This method can be extended to produce fast algorithms for data-flow problems with more complex lattice structures.
Cited by 148 works. doi:10.1145/989393.989418
Authors
References
- Depth-First Search and Linear Graph Algorithms
- Department of Computer Science
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Global Data Flow Analysis and Iterative Algorithms
- A practical interprocedural data flow analysis algorithm
- An efficient way to find the side effects of procedure calls and the aliases of variables
- Interprocedural Data Flow Analysis.
- A precise inter-procedural data flow algorithm
- Data Flow Analysis for Procedural Languages
- Interprocedural dependence analysis and parallelization