@inproceedings{d5aa7bae64f546cbb49f4b150a8dac68,
title = "Automatic construction of sparse data flow evaluation graphs",
abstract = "In this paper, we present an algorithm that constructs sparse evaluation graphs for forward or backward monotone data flow problems. The sparse graph combines information as early as possible, yet directly connects nodes that generate and use information. This allows problems from the large, general class of monotone data flow problems to err joy the advantages of solutions based on Static Single Assignment (SSA) form.",
author = "Choi, \{Jong Deok\} and Ron Cytron and Jeanne Ferrante",
note = "Publisher Copyright: {\textcopyright} 1990 ACM.; 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1991 ; Conference date: 21-01-1991 Through 23-01-1991",
year = "1991",
month = jan,
day = "3",
doi = "10.1145/99583.99594",
language = "English",
isbn = "0897914198",
series = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
publisher = "Association for Computing Machinery",
pages = "55--66",
booktitle = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",
}