@inproceedings{fec221661afb4052b8c8e432ddc46979,
title = "Dependence graphs and compiler optimizations",
abstract = "Dependence graphs can be used as a vehicle for formulating and implementing compiler optimizations. This paper defines such graphs and discusses two kinds of transformations. The first are simple rewriting transformations that remove dependence arcs. The second are abstraction transformations that deal more globally with a dependence graph. These transformations have been implemented and applied to several different types of high-speed architectures.",
author = "Kuck, {D. J.} and Kuhn, {R. H.} and Padua, {D. A.} and B. Leasure and M. Wolfe",
note = "Funding Information: This work was supported in part by the National Science Foundation under Grant Nos. US NSF MCS76-81686 and MCS80-01561. Publisher Copyright: {\textcopyright} 1981 ACM.; 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981 ; Conference date: 26-01-1981 Through 28-01-1981",
year = "1981",
month = jan,
day = "26",
doi = "10.1145/567532.567555",
language = "English (US)",
isbn = "089791029X",
series = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "Association for Computing Machinery",
pages = "207--218",
booktitle = "Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981",
}