## Elimination algorithms for data flow analysis (1986)

### Cached

### Download Links

- [rsim.cs.uiuc.edu]
- [rsim.cs.illinois.edu]
- DBLP

### Other Repositories/Bibliography

by
Barbara G. Ryder
,
Marvin C. Paull

Venue: | ACM Computing Surveys |

Citations: | 53 - 8 self |

### BibTeX

@ARTICLE{Ryder86eliminationalgorithms,

author = {Barbara G. Ryder and Marvin C. Paull},

title = {Elimination algorithms for data flow analysis},

journal = {ACM Computing Surveys},

year = {1986},

volume = {18},

pages = {277--316}

}

### Years of Citing Articles

### OpenURL

### Abstract

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