Detecting Conflicts Between Structure Accesses

ACM SIGPLAN Notices

Volumn 23, Issue 7, 1988, Pages 24-31

  Larus, James R ^a   Hilfinger, Paul N ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976709093     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/960116.53993     Document Type: Article

References (15)

1. John P. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. In Conference Record of the Sixth A CM Symposium on Principles of Programming Languages, pages 29-41, January 1979.
2. Deborah S. Coutant. Retargetable high-level alias analysis. In Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 110–118, January 1986.
3. Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319–349, July 1987.
4. Susan Horwitz, Jan Prins, and Thomas Reps. On the adequacy of program dependence graphs for representing programs. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 146–157, San Diego, California, January 1988.
5. Neil D. Jones and Steven S. Muchnick. Flow analysis and optimization of Lisp-like structures. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, pages 102–131. Prentice-Hall, 1981.
6. Neil D. Jones and Steven S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 66– 74, January 1982.
7. John B. Kam and Jeffrey D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305-317, 1977.
8. V. N. Kas’janov. Distinguishing hammocks in a directed graph. Soviet Mathematics, 16(2):448–450, 1975.
9. D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, pages 207–218, January 1981.
10. James R. Larus and Paul N. Hilfinger. Restructuring Lisp programs for concurrent execution. In ACM SIGPLAN Symposium on Parallel Programming, July 1988. To appear.
11. Eugene W. Myers. A precise inter-procedural data flow algorithm. In Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, pages 219–230, January 1981.
12. John C. Reynolds. Automatic computation of data set definitions. In Information Processing 68, pages 456–461, Amsterdam, Holland, 1969. IFIP, North-Holland Publishing Company.
13. Cristina Ruggieri and Thomas P. Murtagh. Lifetime analysis of dynamically allocated objects. In Conference Record of the Fifteenth Annual A CM Symposium on Principles of Programming Languages, pages 285–293, San Diego, California, January 1988.
14. J. T. Schwartz. Optimization of very high level languages-I: Value transmission and its corollaries. Computer Languages, 1(2):161–194, 1975.
15. Robert Endre Tarjan. A unified approach to path problems. Journal of the ACM, 28(3):577–593, July 1981.