On sparse evaluation representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1302 LNCS, Issue , 1997, Pages 1-15

  Ramalingam, G ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84904961892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032730     Document Type: Conference Paper

References (14)

1. Jong-Deok Choi, Eon Cytron, and Jeanne Ferrsnte. Automatic construction of sparse data flow evaluation graphs. In Conference Record of the Eighteenth ACM Symposium on Principles of Programming Languages, pages 55-66, 1991.
2. T.H. Cormen, C.E. Leiserson, and RL. Itivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
3. Iron Cytron and Jeanne Ferrante. Efficiently computing Φ-nodes on-the-fly. In Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science, pages 461-476. Springer-Verlag, 1993.
4. Iton Cytron, Jeanne Ferrante, Barry K. Itosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method for computing static single assignment form. In Conference Record Of the Sixteenth A CM Symposium on Principles of Programming Languages, pages 25-35, 1989.
5. Iron Cytron, Jeanne Ferrante, Barry K. Itosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):452-490, October 1991.
6. Evelyn Duesterwald, Itajiv Gupta, and Mary Lou Sofia. Iteducing the cost of data flow analysis by congruence partitioning° In International Conference on Compiler Construction, volume 786 of Lecture Notes in Computer Science, pages 357-373. Springer-Verlag, 1994.
7. S.L. Graham and M. Wegman. A fast and usually linear algorithm for global dataflow analysis algorithm. J. ACM, 23(1):172-202, 1976.
8. R. Johnson, D. Pearson, and K. Pingali. The program tree structure: Computing control regions in linear time. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 171-185, 1994.
9. R. Johnson and K. Pingali. Dependence-based program analysis. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 78-89, 1993.
10. G. Kildall. A unified approach to global program optimization. In Conference Record of the First ACM Symposium on Principles of Programming Languages, pages 194-206, New York, NY, 1973. ACM.
11. G. Itamalingam. On Sparse Evaluation Itepresentations. Technical report, IBM, 1997. In Preparation.
12. V.C. Sreedhar and G.R. Gao. A linear time algorithm for placing Φ-nodes. In Conference Record of the $$nd ACM Symposium on Principles of Programming Languages, pages 62-73, 1995.
13. J.D. Ullman. Fast algorithms for the elimination of common subexpressions. Acta Informatica, 2:191-213, 1973.
14. Wuu Yang, Susan Horwitz, and Thomas Iteps. Detecting program components with equivalent behaviors. Technical Report Computer Science Technical tteport Number 840, University of Wisconsin, Madison, April 1989.