Article

Free access

Efficient computation of flow insensitive interprocedural summary information

Authors:

Keith D. Cooper,

Ken KennedyAuthors Info & Claims

SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction

Pages 247 - 258

https://doi.org/10.1145/502874.502898

Published: 01 June 1984 Publication History

PDF eReader

References

[1]

A. Aho, J. Hoperoft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Ma., 1974.

Digital Library

Google Scholar

[2]

J. Banning, "A Method for Determining the Side Effects of Procedure Calls", PhD Dissertation, Stanford University, Aug. 1978.

Digital Library

Google Scholar

[3]

J. Barth, "A Practical Interprocedural Data Flow Analysis Algorithm". CACM Vol. 21, No. 9, Sept. 1978, pp. 724-736.

Digital Library

Google Scholar

[4]

M. Burke, Private Communication, November 1983.

Google Scholar

[5]

K. Cooper, "Interprocedural Data Flow Analysis in a Programming Environment", PhD Dissertation, Rice University, May 1983.

Digital Library

Google Scholar

[6]

R. Farrow, K. Kennedy, and L. Zucconi, "Graph Grammars and Global Program Flow Analysis", Proc. 7 th Ann. 1EEE Syrup. on Foundations Computer Science, Houston, Tx, November 1975.

Google Scholar

[7]

S. Graham and M. Wegman, "A Fast and Usually Linear Algorithm for Global Flow Analysis", JACM Vol. 23, No. 1, January 1976, pp. 172-202.

Digital Library

Google Scholar

[8]

J. Hennessy, "Program Optimization and Exception Handling". Proceedings 8th POPL, Jan. 1981.

Digital Library

Google Scholar

[9]

R. Hood and K. Kennedy, "A Programming Environment for Fortran", Rice University, Department of Computer Science Technical Report, in preparation.

Google Scholar

[10]

J. Kam and J. Ullman, "Global Data Flow Analysis and Iterative Algorithms", JACM, Vol. 23, No. Jan. 1976, pp. 158-171.

Digital Library

Google Scholar

[11]

R. Hood, and K. Kennedy, "A Programming Environment for Fortran", Rice University, Department of Mathematical Sciences TR83-22, 1983.

Google Scholar

[12]

E. Myers, "A Precise and Efficient Algorithm for Determining Existential Summary Data Flow Information", University of Colorado at Boulder, Department of Computer Science Technical Report #CU-CS-175-80.

Google Scholar

[13]

E. Myers, "A Precise Interprocedural Data Flow Algorithm", Proceedings 8th POPL, Jan. 1981.

Digital Library

Google Scholar

[14]

B. Rosen, "Data Flow Analysis for Procedural Languages", JACM, Vol. 26, No. 2, April 1979, pp. 322-344.

Digital Library

Google Scholar

[15]

T. Spillman, "Exposing Side-Effects in a PL/I Optimizing Compiler", IFIPS Proceedings, 1971, pp 376-381.

Google Scholar

[16]

R. Tarjan, "Applications of Path Compression Balanced Trees" JACM, Vol. 26, No. 4, Oct. 1979, pp. 690-715.

Digital Library

Google Scholar

[17]

R. Tarjan, "A Unified Approach to Path Problems", JACM, Vol. 28, No. 3, July 1981, pp. 577-593.

Digital Library

Google Scholar

[18]

R. Tarjan, "Fast Algorithms for Solving Path Problems", JACM, Vol. 28, No. 3, July 1981, pp. 594- 614.

Digital Library

Google Scholar

Cited By

View all

Hardy JPhelan CVigil-Hayes MSu NWyche SSengers P(2019)Designing from the ruralInteractions10.1145/332848726:4(37-41)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328487
Xu W(2019)Toward human-centered AIInteractions10.1145/332848526:4(42-46)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328485
Birk MWadley GAbeele VMandryk RTorous J(2019)Video games for mental healthInteractions10.1145/332848326:4(32-36)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328483
Show More Cited By

Recommendations

Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We present practical approximation methods for computing interprocedural aliases and side effects for a program written in a language that includes pointers, reference parameters and recursion. We present the following results: 1) An algorithm for flow-...
Precise and efficient integration of interprocedural alias information into data-flow analysis

Data-flow analysis is a basis for program optimization and parallelizing transformations. The mechanism of passing reference parameters at call sites generates interprocedural aliases which complicate this analysis. Solutions have been developed for ...
Efficient computation of interprocedural definition-use chains

The dependencies that exist among definitions and uses of variables in a program are required by many language-processing tools. This paper considers the computation of definition-use and use-definition chains that extend across procedure boundaries at ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction

June 1984

328 pages

ISBN:0897911393

DOI:10.1145/502874

General Chair:
Mary Van Deusen
IBM
,
Program Chair:
Susan L. Graham
University of California, Berkeley

ACM SIGPLAN Notices Volume 19, Issue 6
Proceedings of the SIGPLAN '84 symposium on compiler construction
June 1984
318 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/502949
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

139
Total Citations
View Citations
464
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)12

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hardy JPhelan CVigil-Hayes MSu NWyche SSengers P(2019)Designing from the ruralInteractions10.1145/332848726:4(37-41)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328487
Xu W(2019)Toward human-centered AIInteractions10.1145/332848526:4(42-46)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328485
Birk MWadley GAbeele VMandryk RTorous J(2019)Video games for mental healthInteractions10.1145/332848326:4(32-36)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328483
Fuchsberger V(2019)The future's hybrid natureInteractions10.1145/332848126:4(26-31)Online publication date: 26-Jun-2019
https://dl.acm.org/doi/10.1145/3328481
Nichols LEmre MHardekopf BGrech NLavoie T(2019)Fixpoint reuse for incremental JavaScript analysisProceedings of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis10.1145/3315568.3329964(2-7)Online publication date: 22-Jun-2019
https://dl.acm.org/doi/10.1145/3315568.3329964
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
Szabó TBergmann GErdweg SVoelter M(2018)Incrementalizing lattice-based program analyses in DatalogProceedings of the ACM on Programming Languages10.1145/32765092:OOPSLA(1-29)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276509
Abal IBrabrand CWąsowski A(2017)Effective Bug Finding in C Programs with Shape and Effect AbstractionsVerification, Model Checking, and Abstract Interpretation10.1007/978-3-319-52234-0_3(34-54)Online publication date: 12-Jan-2017
https://doi.org/10.1007/978-3-319-52234-0_3
Szabó TErdweg SVoelter MLo DApel SKhurshid S(2016)IncA: a DSL for the definition of incremental program analysesProceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering10.1145/2970276.2970298(320-331)Online publication date: 25-Aug-2016
https://dl.acm.org/doi/10.1145/2970276.2970298
Aghayev AShafaei MDesnoyers P(2015)Skylight—A Window on Shingled Disk OperationACM Transactions on Storage10.1145/282151111:4(1-28)Online publication date: 16-Oct-2015
https://dl.acm.org/doi/10.1145/2821511
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Recommendations

Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects

Precise and efficient integration of interprocedural alias information into data-flow analysis

Efficient computation of interprocedural definition-use chains