Article

Free access

Fast interprocedual alias analysis

Authors:

K. KennedyAuthors Info & Claims

POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 49 - 59

https://doi.org/10.1145/75277.75282

Published: 03 January 1989 Publication History

Abstract

We present a new algorithm for computing interprocedural aliases due to passing parameters by reference. This algorithm runs in O(N²+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(N²+NE) time.

References

[1]

F.E. Allen, "Interprocedural data flow analysis", Proc. of the 197~ IFIPS Congress, 1974.]]

[2]

J.P. Banning, "An efficient way to find the side effects of procedure calls and the aliases of variables", Proc. Sixth POPL, Jan., 1979.]]

Digital Library

[3]

J.M. Barth, "A practical interprocedural data flow analysis algorithm", CACM 21(9), Sept., 1978.]]

Digital Library

[4]

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.]]

[5]

M. Burke and R. Cytron, "lnterprocedural dependence analysis and parallelization" Pro~. SIaPLAN 86 Symposium on Compiler Construction, srOeLa~~ Notices 21(7), July 1986.]]

Digital Library

[6]

D. Callaha~, "The program summary graph and flow-sensitive interproeedural data flow analysis", Proc. SIGPLAlV 88 Conference on Programming Language Design and Implementation, SIGPLAN Notices 23(7), July 1988.]]

Digital Library

[7]

D. Callahun, K.D. Cooper, K. Kennedy, and L. Torczon, "interprocedural constant propagation", Proc. SIGPLAN 86 Symposium on Compiler Construction, SIGPLAN Notices, 21(7), July 1986.]]

Digital Library

[8]

D. Cullahaa and K. Kennedy, "Analysis of interprocedural side effects in a parallel programming environment", Proc. First lnt'l Conference on Supercomputing, Athens, Greece, June 1987.]]

Digital Library

[9]

M.D. Carroll and B.C. Ryder, "An incremental algorithm for software analysis" Proc. of the SIGSOF'r/sIGPLA_~ Software Engineering Symposium on Practical Software Development Environments, sta. PLAN Notice8 22(1), Jan. 1987.]]

Digital Library

[10]

K.D. Cooper, "Analyzing aliases of referenee formal parameters", Proc. Twelfth FOPL, Jan. 1985.]]

Digital Library

[11]

K.D. Cooper and K. Kennedy, "Efficient computation of flow insensitive interprocedural summary information", Proe. SlO. PLAN 8~ Symposium on Compiler Construction, SIGPLAN Notices 19(6), June 1984.]]

Digital Library

[12]

K.D. Cooper and K. Kennedy, "Efficient computation of flow-insensitive interproeedural summary information -- a correction", SIGPLAN Notices, 23(4), April, 1988 (also TR87-60, Department of Computer Science, Rice University, Oct. 1987).]]

Digital Library

[13]

K.D. Cooper and K. Kennedy, "Interproeedural side-effect analysis in linear time", Froc. SIGPLAN 88 Conference on Programming Language Design and Implementation, SIGPLAN Notices 23(7), July 1988.]]

Digital Library

[14]

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.]]

Digital Library

[15]

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.]]

[16]

B. Rosen, "Data flow analysis for procedural languages", JACM 26(2), April, 1979.]]

Digital Library

[17]

T.C. Spillma~, "Exposing side-effects in a PL/I optimizing compiler", Proc. of the 1971 IFIPS Gongrees, 1971.]]

[18]

L. Torczon, "Compilation dependences in an ambitious optimizing compiler", Ph.D. dissertation, Department of Computer Science, Rice University, May, 1985.]]

Digital Library

Cited By

Chitre KKedia PPurandare R(2023)Rapid: Region-Based Pointer DisambiguationProceedings of the ACM on Programming Languages10.1145/36228597:OOPSLA2(1729-1757)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622859
Chitre KKedia PPurandare R(2022)The road not taken: exploring alias analysis based optimizations missed by the compilerProceedings of the ACM on Programming Languages10.1145/35633166:OOPSLA2(786-810)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563316
Khan SChatterjee BPande SRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)VICOProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532393(1-14)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532393
Show More Cited By

Index Terms

Fast interprocedual alias analysis

Recommendations

Demand-driven alias analysis for C
POPL '08: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

This paper presents a demand-driven, flow-insensitive analysisalgorithm for answering may-alias queries. We formulate thecomputation of alias queries as a CFL-reachability problem, and use this formulation to derive a demand-driven analysis algorithm. ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Context-insensitive alias analysis reconsidered
PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation

Recent work on alias analysis in the presence of pointers has concentrated on context-sensitive interprocedural analyses, which treat multiple calls to a single procedure independently rather than constructing a single approximation to a procedure's ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1989

352 pages

ISBN:0897912942

DOI:10.1145/75277

Editor:
CORPORATE New York, NY Association for Computing Machinery

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL89

Sponsor:

POPL89: Symposium on the Principles of Programming Languages

January 11 - 13, 1989

Texas, Austin, USA

Acceptance Rates

POPL '89 Paper Acceptance Rate 30 of 191 submissions, 16%;

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

64
Total Citations
View Citations
663
Total Downloads

Downloads (Last 12 months)93
Downloads (Last 6 weeks)19

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chitre KKedia PPurandare R(2023)Rapid: Region-Based Pointer DisambiguationProceedings of the ACM on Programming Languages10.1145/36228597:OOPSLA2(1729-1757)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622859
Chitre KKedia PPurandare R(2022)The road not taken: exploring alias analysis based optimizations missed by the compilerProceedings of the ACM on Programming Languages10.1145/35633166:OOPSLA2(786-810)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563316
Khan SChatterjee BPande SRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)VICOProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532393(1-14)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532393
Honorio Bde Carvalho JSkaf MAraujo G(2020)Using OpenMP to Detect and Speculate Dynamic DOALL LoopsOpenMP: Portable Multi-Level Parallelism on Modern Systems10.1007/978-3-030-58144-2_15(231-246)Online publication date: 1-Sep-2020
https://doi.org/10.1007/978-3-030-58144-2_15
Shivam AWolfe M(2019)OpenACC Routine Directive Propagation Using Interprocedural AnalysisAccelerator Programming Using Directives10.1007/978-3-030-12274-4_5(99-113)Online publication date: 24-Jan-2019
https://doi.org/10.1007/978-3-030-12274-4_5
Kempf SVeldema RPhilippsen M(2014)Is There Hope for Automatic Parallelization of Legacy Industry Automation Applications?PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware10.1007/BF0334198728:1(80-89)Online publication date: 6-Feb-2014
https://doi.org/10.1007/BF03341987
Angerer FPrahofer HRamler RGrillenberger F(2013)Points-to analysis of IEC 61131-3 programs: Implementation and application2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA)10.1109/ETFA.2013.6648062(1-8)Online publication date: Sep-2013
https://doi.org/10.1109/ETFA.2013.6648062
Khedker U(2010)Data Flow AnalysisThe Compiler Design Handbook10.1201/9781420040579.ch1Online publication date: 7-Mar-2010
https://doi.org/10.1201/9781420040579.ch1
Khedker USanyal ASathe B(2010)ReferencesData Flow Analysis10.1201/9780849332517.bmatt(371-378)Online publication date: 13-Jan-2010
https://doi.org/10.1201/9780849332517.bmatt
Drozdov ANovikov S(2009)A program auto-parallelizer based on the component technology of optimizing compiler constructionProgramming and Computing Software10.1134/S036176880906003635:6(321-339)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1134/S0361768809060036
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten