| Fast interprocedual alias analysis |
| Full text |
Pdf
(1.01 MB)
|
| Source
|
Annual Symposium on Principles of Programming Languages
archive
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
table of contents
Austin, Texas, United States
Pages: 49 - 59
Year of Publication: 1989
ISBN:0-89791-294-2
|
|
Authors
|
|
K. D. Cooper
|
Department of Computer Science, Rice University, Houston, Texas
|
|
K. Kennedy
|
Department of Computer Science, Rice University, Houston, Texas
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 36, Citation Count: 38
|
|
|
ABSTRACT
We present a new algorithm for computing interprocedural aliases due to passing parameters by reference. This algorithm runs in O(N2+NE) time and, when combined with algorithms for alias-free, flow-insensitive data-flow problems, yields algorithms for solution of the general flow-insensitive problems that also run in O(N2+NE) time.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
Alle 74
|
F.E. Allen, "Interprocedural data flow analysis", Proc. of the 197~ IFIPS Congress, 1974.
|
 |
Bann 79
|
|
 |
Bart 78
|
|
| |
Burk 84
|
M. Burke, "An interval analysis approach toward interprocedural data flow", Report RC 10640, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., July, 1984.
|
 |
BuCy 86
|
|
 |
Call 88
|
|
 |
CCKT 86
|
|
| |
CaKe 87
|
|
 |
CaRy 86
|
|
 |
Coop 85
|
|
 |
CoKe 84
|
|
 |
CoKe 87
|
|
 |
CoKe 88
|
|
| |
HoRB 88
|
S. Horwitz, T. Reps and D Binkley, "Interprocedural slicing using dependence graphs", Proc. SIGPLAN 88 Conference on Programming Language Design and Implementation, SIGPLAN Notices 23(7), July 1988.
|
| |
Myer 80
|
E. Myers, "A precise a~d efficient ulgorithm for determining existential summary data flow information", Technical Report CU-CS-175-80, Department of Computer Science, University of Colorado, Masch, 1980.
|
 |
Rose 79
|
|
| |
Spil 71
|
T.C. Spillma~, "Exposing side-effects in a PL/I optimizing compiler", Proc. of the 1971 IFIPS Gongrees, 1971.
|
| |
Torc 85
|
|
CITED BY 38
|
|
Hemant D. Pande , William Landi, Interprocedural Def-Use associations in C programs, Proceedings of the symposium on Testing, analysis, and verification, p.139-153, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
Pedro V. Artigas , Manish Gupta , Samuel P. Midkiff , José E. Moreira, Automatic loop transformations and parallelization for Java, Proceedings of the 14th international conference on Supercomputing, p.1-10, May 08-11, 2000, Santa Fe, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
David Bernstein , Doron Cohen , Dror E. Maydan, Dynamic memory disambiguation for array references, Proceedings of the 27th annual international symposium on Microarchitecture, p.105-111, November 30-December 02, 1994, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas Reps , Susan Horwitz , Mooly Sagiv, Precise interprocedural dataflow analysis via graph reachability, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 23-25, 1995, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Saumya Debray , Robert Muth , Matthew Weippert, Alias analysis of executable code, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-24, January 19-21, 1998, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas J. Marlowe , William G. Landi , Barbara G. Ryder , Jong-Deok Choi , Michael G. Burke , Paul Carini, Pointer-induced aliasing: a clarification, ACM SIGPLAN Notices, v.28 n.9, p.67-70, Sept. 1993
|
|
|
|
|