skip to main content
article
Free Access

Data Flow Analysis for Procedural Languages

Authors Info & Claims
Published:01 April 1979Publication History
First page image

References

  1. 1 ALLEN, F E Program optimization Ann Review m Automanc Programming 5 (1969), 239-307Google ScholarGoogle Scholar
  2. 2 ALLEN, F E Interprocedural data flow analys~s Information Processing 74, North-Holland Pub Co, Amsterdam, 1974, pp 398-402Google ScholarGoogle Scholar
  3. 3 BARTH, J Interprocedural data flow analysis based on transitive closure Rep UCB-CS-76-44, Comptr So Dept, U of California, Berkeley, Sept 1976 (summary m Proc 4th ACM Symp on Principles of Programming Languages, Santa Momca, Cahf, Jan 1977, pp. 119-131) Google ScholarGoogle Scholar
  4. 4 COCKE, J Global common subexpresston ehmlnatlon SIGPLAN NoUces (ACM) 5, 7 (July 1970), 20-24 Google ScholarGoogle Scholar
  5. 5 FOSDICK, L D, AND OSTERWEIL, L J Data flow analysis m software rehabdlty Comptng Surveys 8, 3 (Sept 1976), 305-330 Google ScholarGoogle Scholar
  6. 6 GRAHAM, S L, AND WEGMAN, M A fast and usually linear algorithm for global flow analysis. J A CM 23, 1 (Jan 1976), 172-202 Google ScholarGoogle Scholar
  7. 7 HECHT, M S, AND SCHAEFFER, J B Ideas on the design of a quad improver for SIMPL-T, Pt 1 Tech Rep TR-405, Comptr Scl Dept, U of Maryland, College Park, Md, Aug 1975Google ScholarGoogle Scholar
  8. 8 HECHT, M S, AND ULLMAN, J D A simple algorithm for global data flow analysis problems SIAM J Comptng 4 (1975), 519-532Google ScholarGoogle Scholar
  9. 9 KAM, J B , AND ULLMAN, J D Global data flow analysis and iteratlve algorithms J ACM 23, 1 (Jan 1976), 158-171 Google ScholarGoogle Scholar
  10. 10 KENNEDY, K A global flow analysis algorithm Int J Comptr Math (A) 3 (1971), 5-15Google ScholarGoogle Scholar
  11. 11 KENNEDY, K Node listings applied to data flow analysis Conf Rec 2nd ACM Symp on Pnnclples of Programming Languages, Palo Alto, Cahf, Jan 1975, pp 10-21 Google ScholarGoogle Scholar
  12. 12 LOMET, D B Data flow analysis in the presence of procedure calls IBM J Res and Develop 21 (1977), 559- 571Google ScholarGoogle Scholar
  13. 13 LOWR'~, E S, AND MEDLOCK, C W Object code optimization Comm ACM 12, 1 (Jan 1969), 13-22 Google ScholarGoogle Scholar
  14. 14 ROSEN, B K Tree-mampulatlng systems and Church-Rosser theorems J ACM 20, I (Jan 1973), 160-187 Google ScholarGoogle Scholar
  15. 15 ROSEN, B K Data flow analysis for recursive PL/I programs Res Rep RC 5211, IBM T J Watson Res Ctr, Yorktown Heights, N Y, Jan 1975Google ScholarGoogle Scholar
  16. 16 ROSEN, B K Correctness of parallel programs the Church-Rosser approach Theoret Comptr Sct 2 (1976), 183-207Google ScholarGoogle Scholar
  17. 17 ROSEN, B K High level data flow analysis Comm ACM 20, 10 (Oct 1977), 712-724 Google ScholarGoogle Scholar
  18. 18 ROSEN, B K Monoids for rapid data flow analysis Conf Rec 5th Ann ACM Symp on Principles of Programming Languages, Tucson, Anz, Jan 1978, pp 47-59 Google ScholarGoogle Scholar
  19. 19 SPILLMAN, T C Exposing the side effects in a PL/I optimizing compiler Information Processing 71, North- Holland Pub Co, Amsterdam, 1971, pp 376-381Google ScholarGoogle Scholar
  20. 20 STRONG, H R, MAGGIOLO-SCHETTINI, A, AND ROSEN, B K Recursion structure simpllficauon SlAM J Comptng 4 (1975), 307-320Google ScholarGoogle Scholar
  21. 21 ULLMAN, J D Fast algorithms for the elimination of common subexpressions Acta Informattca 2 (1973), 191-213Google ScholarGoogle Scholar
  22. 22 ULLMAN, J D Data flow analysis Proc Second USA-Japan Comptr Conf, 1975, pp 335-342Google ScholarGoogle Scholar
  23. 23 VARGA, R S Matrix Iterattve Analysts Prentice-Hall, Englewood Cliffs, N J, 1972Google ScholarGoogle Scholar
  24. 24 WIRTH, N, AND HOARE, C A R A contribution to the development of ALGOL Comm A CM 9, 6 (June 1966), 413--431,432-433 Google ScholarGoogle Scholar

Index Terms

  1. Data Flow Analysis for Procedural Languages

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Journal of the ACM
          Journal of the ACM  Volume 26, Issue 2
          April 1979
          205 pages
          ISSN:0004-5411
          EISSN:1557-735X
          DOI:10.1145/322123
          Issue’s Table of Contents

          Copyright © 1979 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 April 1979
          Published in jacm Volume 26, Issue 2

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader