Elimination algorithms for data flow analysis
Barbara G. Ryder, Marvin C. Paull · ACM Computing Surveys · 1986
A unified model of a family of data flow algorithms, called elimination methods, is presented. The algorithms, which gather information about the definition and use of data in a program or a set of programs, are characterized by the manner in which they solve the systems of equations that describe data flow problems of interest. The unified model provides implementation-independent descriptions of the algorithms to facilitate comparisons among them and illustrate the sources of improvement in worst case complexity bounds. This tutorial provides a study in algorithm design, as well as a new view of these algorithms and their interrelationships.
Cited by 120 works. doi:10.1145/27632.27649 Open-access PDF
Authors
References
- The Art of Computer Programming
- The Design and Analysis of Computer Algorithms
- Depth-First Search and Linear Graph Algorithms
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Analysis of Numerical Methods
- An empirical study of FORTRAN programs
- A unified approach to global program optimization
- Flow Analysis of Computer Programs
- A program data flow analysis procedure
- The FORTRAN automatic coding system