References
- Kennedy , K. 1971 . A global flow analysis algorithm . Intern. J. Computer Math. , 3 : 5 – 15 . Section A
- Allen , F. E. and Cocke , J. 1972 . “ Graph-theoretic constructs for program control flow analysis ” . In IBM Research , N.Y. : Yorktown Heights . Report RC 3923
- Earnest , C. P. , Balke , K. G. and Anderson , J. 1972 . Analysis of graphs by ordering of nodes . JACM , 19 ( 1 ) : 23 – 42 .
- Earnest , C. P. 1974 . Some topics in code optimization . JACM , 21 ( 1 ) : 76 – 102 .
- Kildall , G. A. 1973 . A unified approach to global program optimization . Proceedings of ACM Symposium on Principals of Programming Languages . October 1973 , Boston, Mass. pp. 194 – 206 .
- Hecht , M. S. and Ullman , J. D. 1973 . Analysis of a simple algorithm for global flow problems . Proceedings of ACM Symposium on Principals of Programming Languages . October 1973 , Boston, Mass. pp. 207 – 217 .
- Kennedy K. A comparison of algorithms for global data flow analysis Technical report 476-093-1 Department of Mathematical Sciences,Rice University Houstonfs, Texas 77001