Dependence Analysis for Pointer Variables

ACM SIGPLAN Notices

Volumn 24, Issue 7, 1989, Pages 28-40

  Horwitz, S ^a   Pfeiffer, P ^a   Reps, T ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--PROGRAMMING THEORY;

DATA DEPENDENCES; DEPENDENCE ANALYSIS; POINTER VARIABLES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0024701519     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/74818.74821     Document Type: Article

References (27)

1. Aho, A.V., Sethi, R., and Miman, J.D., Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA (1986).
2. Allen, J.R., “Dependence analysis for subscripted variables and its application to program transformations,” Ph.D. dissertation, Dept. of Math. Sciences, Rice Univ., Houston, TX (April 1983).
3. Chase, D.R., “Garbage collection and other optimizations,” Ph.D. dissertation, Dept. of Computer Science, Rice Univ., Houston, TX (August 1987).
4. Cousot, P. and Cousot, R., “Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints,” pp. 238-252 in Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, (Los Angeles, CA, January 17-19, 1977), ACM, New York, NY (1977).
5. Donzeau-Gouge, V., “Denotational definition of properties of program computations,” in Program Flow Analysis: Theory and Applications, ed. S.S. Muchnick and N.D. Jones,Prentice-Hall, Englewood Cliffs, NJ (1981).
6. Ferrante, J., Ottenstein, K., and Warren, J., “The program dependence graph and its use in optimization,” ACM Transactions on Programming Languages and Systems 9(3) pp. 319-349 (July 1987).
7. Guama, V.A. Jr., “A technique for analyzing pointer and structure references in parallel restructuring compilers,” CSRD Tech. Rep. 721, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, IL (January 1988).
8. Horwitz, S., Prins, J., and Reps, T., “Integrating non-interfering versions of programs,” pp. 133-145 in Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, (San Diego, CA, January 13-15, 1988), ACM, New York, NY (1988).
9. Horwitz, S., Reps, T., and Binkley, D., “Interprocedural slicing using dependence graphs,” Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23(7)(July 1988).
10. Horwitz, S., Pfeiffer, P., and Reps, T., “Dependence analysis for pointer variables,” In preparation, Computer Sciences Department, University of Wisconsin, Madison, WI (1989).
11. Hudak, P., “A semantic model of reference counting and its abstraction,” pp. 45-62 in Abstract Interpretation of Declarative Languages, ed. S. Abramsky and C. Hankin,Ellis Horwood Limited, Chichester, West Sussex, England (1987).
12. Jones, N.D. and Muchnick, S.S., “Flow analysis and optimization of Lisp-like structures,” in Program Flow Analysis: Theory and Applications, ed. S.S. Muchnick and N.D. Jones,Prentice-Hall, Englewood Cliffs, NJ (1981).
13. Kennedy, K., “A survey of data flow analysis techniques,” in Program Flow Analysis: Theory and Applications, ed. S.S. Muchnick and N.D. Jones,Prentice-Hall, Englewood Cliffs, NJ (1981).
14. Kuck, D.J., Kuhn, R.H., Lea sure, B., Padua, D.A., and Wolfe, M., “Dependence graphs and compiler optimizations,” pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).
15. Larus, J.R., “Curare: Restructuring Lisp programs for concurrent execution,” UCB/CSD 87/344, Computer Science Division, Dept. of Elec. Eng. and Comp. Sci., Univ. of California - Berkeley, Berkeley, CA (February 1987).
16. Lams, J.R. and Hilfinger, P.N., “Detecting conflicts between structure accesses,” Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 22-24, 1988), ACM SIGPLAN Notices 23(7) pp. 21-34
17. (July 1988).
18. Larus, J.R. and Hilfinger, P.N., “Restructuring Lisp programs for concurrent execution,” Proceedings of the ACM/SIGPLAN PPEALS 88 (New Haven, CT, July 19-21, 1988), ACM SIGPLAN Notices 23(9) pp. 100-110 (September 1988).
19. Larus, J.R., “Refining and Classifying Data Dependences,” unpublished extended abstract, Berkeley, CA (November 1988).
20. Larus, J.R., private communication. 1988.
21. Neirynck, A., “Static Analysis of Aliases and Side Effects in Higher-Order Languages,” Ph.D. dissertation, Computer Science Department, Cornell University, Ithaca, NY (February 1988).
22. Ottenstein, K.J. and Ottenstein, L.M., “The program dependence graph in a software development environment,” Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, (Pittsburgh, PA, Apr. 23-25, 1984), ACM SIGPLAN Notices 19(5) pp. 177-184 (May 1984).
23. Padua, D.A., “Multiprocessors: Discussion of some theoretical and practical problems,” Ph.D. dissertation and Tech. Rep. R-79-990, Dept. of Computer Science, University of Illinois, Urbana, IL (November 1979).
24. Reps, T. and Yang, W., “The semantics of program slicing,” TR-777, Computer Sciences Department, University of Wisconsin, Madison, WI (June 1988).
25. Ruggieri, C. and Murtagh, T.P., “Lifetime analysis of dynamically allocated objects,” pp. 285-293 in Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, (San Diego, CA, January 13-15, 1988), ACM, New York, NY (1988).
26. Stransky, J., “Analyse sémantique de structures de données dynamiques avec application au cas particulier de langages LISPiens,” Ph.D. dissertation. Université de Paris-Sud, Centre d'Orsay (June 1988).
27. Weiser, M., “Program slicing,” IEEE Transactions on Software Engineering SE-10(4)pp. 352-357 (July 1984).