On sparse evaluation representations

  • G. Ramalingam
Procedural Programming I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1302)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante. 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.Google Scholar
  2. 2.
    T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.Google Scholar
  3. 3.
    Ron 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.Google Scholar
  4. 4.
    Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method for computing static single assignment form. In Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, pages 25–35, 1989.Google Scholar
  5. 5.
    Ron Cytron, Jeanne Ferrante, Barry K. Rosen, 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.Google Scholar
  6. 6.
    Evelyn Duesterwald, Rajiv Gupta, and Mary Lou Soffa. Reducing 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.Google Scholar
  7. 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.Google Scholar
  8. 8.
    R. Johnson, D. Pearson, and K. Pingali. The program tree structure: Computing control regions in linear time. In Proceedings of the SIGPLAN '9l, Conference on Programming Language Design and Implementation, pages 171–185, 1994.Google Scholar
  9. 9.
    R. Johnson and K. Pingali. Dependence-based program analysis. In Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 78–89, 1993.Google Scholar
  10. 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.Google Scholar
  11. 11.
    G. Ramalingam. On Sparse Evaluation Representations. Technical report, IBM, 1997. In Preparation.Google Scholar
  12. 12.
    V.C. Sreedhar and G.R. Gao. A linear time algorithm for placing ϕ-nodes. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, pages 62–73, 1995.Google Scholar
  13. 13.
    J.D. Ullman. Fast algorithms for the elimination of common subexpressions. Acta Informatica, 2:191–213, 1973.Google Scholar
  14. 14.
    Wuu Yang, Susan Horwitz, and Thomas Reps. Detecting program components with equivalent behaviors. Technical Report Computer Science Technical Report Number 840, University of Wisconsin, Madison, April 1989.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • G. Ramalingam
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations