Interprocedural may-alias analysis for pointers: Beyond k-limiting

ACM SIGPLAN Notices

Volumn 29, Issue 6, 1994, Pages 230-241

  Deutsch, Alain ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976688579     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/773473.178263     Document Type: Article

References (45)

1. ACM Press. Eighteenth Annual ACM Symp. on Principles of Programming Languages, Orlando, FL, Jan. 1991.
2. ACM Press. SIGPLAN'92 Conf. on Programming Language Design and Implementation, volume 27(7) of SIGPLAN Notices, San Francisco, June 1992.
3. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986.
4. V. Balasundaram and K. Kennedy. A technique for summarizing data access and its use in parallelism enhancing transformations. In SIGPLAN'89 Conf. on Programming Language Design and Implementation, volume 24(7) of SIGPLAN Notices, pp. 41-53, June 1989.
5. J. Brzozowski. Derivatives of regular expressions. J. A CM, 11:481-494, 1964.
6. D.R. Chase, M. Wegman, and F.K. Zadeck. Analysis of pointers and structures. In Conf. on Programming Language Design and Implementation, volume 25(6) of SIGPLAN Notices, pp. 296-310, June 1990.
7. J.D. Choi, M.G. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side-effects. In Twentieth Annual ACM Symp. on Principles of Programming Languages, pp. 232-245. ACM Press, Jan. 1993.
8. J.D. Choi, R. Cytron, and J. Ferrante. Automatic construction of sparse evaluation graphs. In [POP91].
9. P. Cousot. Semantic foundations of program analysis. In Program Flow Analysis: Theory and Applications, pp. 303-342. Prentice-Hall, 1981.
10. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixpoints. In Fourth Annual ACM Symp. on Principles of Programming Languages, pp. 238-252, Jan. 1977.
11. P. Cousot and R. Cousot. Static determination of dynamic properties of generalized type unions. SIGPLAN Notices, 12(3):77-94, Mar. 1977.
12. P. Cousot and R. Cousot. Static determination of dynamic properties of recursive procedures. In Working Conf. on Formal Description of Programming Concepts. IFIP WG 2.2, North-Holland, Aug. 1977.
13. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Sixth Annual ACM Symp. on Principles of Programming Languages, pp. 269-282, 1979.
14. P. Cousot and R. Cousot. Comparing the Galois connection and widening-narrowing approaches to abstract interpretation. In Programming Language Implementation and Logic Programming, 4th Intl. Symp, PLILP’92, volume 631 of Lecture Notes on Computer Science, pp. 269-295. Springer Verlag, Aug. 1992.
15. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Fifth Annual ACM Symp. on Principles of Programming Languages, pp. 84-97, Jan. 1978.
16. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In Seventeenth Annual ACM Symp. on Principles of Programming Languages, pp. 157-168. ACM Press, Jan. 1990.
17. A. Deutsch. Operational Models of Programming Languages and Representations of Relations on Regular Languages with Application to the Static Determination of Dynamic Aliasing Properties of Data. PhD thesis, LIX, Ecole Polytechnique, F-91128, Palaiseau, France, 1992.
18. A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In [ICC92], pp. 2-13.
19. E. Duesterwald, R. Gupta, and M.L. Soffa. Reducing the cost of data flow analysis by congruence partitionning. In International Conference on Compiler Construction, to appear in the Springer Verlag Lecture Notes in Computer Science, Apr. 1994.
20. S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974.
21. P. Granger. Static analysis of arithmetical congruences. International Journal of Computer Mathematics, 30:165-190, 1989.
22. P. Granger. Static analysis on linear congruence equalities among variables of a program. In TAPSOFT’91, volume 493 of Lecture Notes on Computer Science, pp. 169-192. Springer Verlag, 1991.
23. P. Granger. Improving the results of static analyses of programs by local decreasing iterations (extended abstract). In Proc. 12th Conference of Foundations of Software Technology and Theoretical Computer Science, Lecture Notes on Computer Science, pp. 68-79. Springer Verlag, Dec. 1992.
24. N. Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d'un programme. PhD thesis, Université Scientifique et Médicale de Grenoble & Institut National Polytechnique de Grenoble, Grenoble, France, Mar. 1979.
25. L. Hederman. Compile time garbage collection. Master's thesis, Rice University, Houston, Aug. 1988. Tech. report COMP TR88-75.
26. L. Hendren. Parallelizing programs with recursive data structures. IEEE Trans. on Parallel and Distributed Processing, 1:35-47, Jan. 1990.
27. L.J. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In [PLD92], pp. 249-260.
28. S. Horwitz, P. Pfeiffer, and T. Reps. Dependence analysis for pointer variables. In Conf. on Programming Language Design and Implementation, volume 24(7) of SIGPLAN Notices, pp. 28-40, June 1989.
29. P. Hudak. A semantic model of reference counting and its abstraction. In Conf. Record of the 1986 ACM Symp. on LISP and Functional Programming, pp. 351-363, Aug. 1986.
30. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976.
31. G. Kildall. A unified approach to global program optimisation. In ACM Symp. on Principles of Programming Languages, pp. 194-206, 1973.
32. W. Landi. Interprocedural Aliasing in the Presence of Pointers. PhD thesis, Rutgers University, Jan. 1992.
33. W. Landi. Undecidability of static analysis. ACM Letters on Programming Languages and Systems, 1(4):323-337, Dec. 1992.
34. W. Landi and B.G. Ryder. Pointer-induced aliasing. In [POP91], pp. 93-103.
35. W. Landi and B.G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In [PLD92], pp. 235-248.
36. T.J. Marlowe, W.G. Landi, B.G. Ryder, J.D. Choi, M.G. Burke, and P. Carini. Pointer-induced aliasing: A clarification. SIGPLAN Notices, 28(9):67-70, Sept. 1993.
37. F. Masdupuy. Using abstract interpretation to detect array data dependencies. In Proc. of the International Symp. on Supercomputing, pp. 19-27. Kyushu University Press, Nov. 1991. ISBN 4-87378-284-8.
38. E. Morel. Data flow analysis and global optimisation. In B. Lorho, editor, Methods and Tools for Compiler Construction, an Advanced Course, pp. 289-315. Cambridge University Press, 1984.
39. A. Neirynck, P. Panangaden, and A.J. Demers. Computation of aliases and support sets. In Fourteenth Annual ACM Symp. on Principles of Programming Languages, pp. 274-283, 1987.
40. B. Rau and J. Fisher. Instruction-level parallel processing. The Journal of Supercomputing, 7:9-50, 1993.
41. C. Ruggieri and T. Murtagh. Lifetime analysis of dynamically allocated objects. In Fifteenth Annual ACM Symp. on Principles of Programming Languages, pp. 285-293. ACM Press, Jan. 1988.
42. S. Sagiv, N. Francez, M. Rodeh, and R. Wilhem. A logic-based approach to data flow analysis. In Programming Language Implementation and Logic Programming, volume 456 of Lecture Notes on Computer Science, pp. 277-292. Springer Verlag, Aug. 1990.
43. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, pp. 189-234. Prentice-Hall, 1981.
44. O. Shivers. Control-flow Analysis of Higher-Order Languages. PhD thesis, Carnegie Mellon University, Pittsburgh, May 1991. CMU-CS-91-145.
45. J. Stransky. A lattice for abstract interpretation of dynamic (Lisp-like) structures. Information and Computation, 101(1):70-102, Nov. 1992.