ACM Home Page
Please provide us with feedback. Feedback
Fast interprocedual alias analysis
Full text PdfPdf (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
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 36,   Citation Count: 38
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/75277.75282
What is a DOI?

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

Collaborative Colleagues:
K. D. Cooper: colleagues
K. Kennedy: colleagues