Article

Free access

The program summary graph and flow-sensitive interprocedual data flow analysis

Author:

D. CallahanAuthors Info & Claims

PLDI '88: Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation

Pages 47 - 56

https://doi.org/10.1145/53990.53995

Published: 01 June 1988 Publication History

PDF eReader

References

[1]

F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante. An overview of the PTRAN analysis system for multiprocessing. In Proceedings of the First International Conference on Supercomputing, Springer- Verlag, Athens, Greece, 1987.

Digital Library

Google Scholar

[2]

F. E. Allen. Interprocedural data flow analysis. In Proceedings IFIP Congrezs 7.4, North-Holland Publishing Co., Amsterdam, 1974.

Google Scholar

[3]

F. E. Allen and J. T. Schwartz. Determining the data relationships in a collection of procedures. Research Report RC 4989, IBM T. J. Watson Research Center, August 1974.

Google Scholar

[4]

J. R. Allen, D. Baumgartner, K. Kennedy, and A. Portereld. PTOOL: a semi-automatic parallel programming assistant. In Proceedings o! the 1986 International Conference on Parallel Processing, IEEE Computer Society Press, August 1986.

Google Scholar

[5]

J. It. Allen and K. Kennedy. PFC: a program to convert Fortran to parallel form. Technical Report MASC-TR 82-6, Dept. of Mathematical Sciences, Rice University, March 1982.

Google Scholar

[6]

M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, pages 162-175, June 1986.

Digital Library

Google Scholar

[7]

D. Callahan, K. Cooper, K. Kennedy, and L. Torczon. interprocedural constant propagation, in Proceedings of the $IGPLAN '86 Symposium on Compiler Construction, June 1986.

Digital Library

Google Scholar

[8]

D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. In Proceedings of the First International Conference on Supercomputing, Springer-Verlag, Athens, Greece, 1987. Available as Rice University, Department of Computer Science Technical Report TR87- 56, July 1987.

Digital Library

Google Scholar

[9]

K. Cooper. Analyzing aliases of reference formal parameters. In Conference Record of the Twelfth A CM Symposium on the Principles of Programming Languages, January 1985.

Digital Library

Google Scholar

[10]

K. Cooper. Interprocedural Data Flow Analysis in a Programming Environment. PhD thesis, Dept. of Computer Science, Rice University, April 1983.

Digital Library

Google Scholar

[11]

K. Cooper and K. Kennedy. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the SIGPLAN '85 Symposium on Compiler Construction, SIGPLAN Notices Vol. 19, No. 6, July 1985.

Digital Library

Google Scholar

[12]

K. Cooper and K. Kennedy. Interprocedural sideeffect analysis in linear time. In Proceedings of the A CM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.

Digital Library

Google Scholar

[13]

K. Cooper, K. Kennedy, and L. Torczan. The impact of interprocedural analysis and optimization in the JR.n programming environment. A CM Transactions on Programming Languages and Systems, 8(4):419- 523, October 1986.

Digital Library

Google Scholar

[14]

S. Graham and M. Wegman. A fast and usually linear algorithm for global datg flow analysis. Journal of the A CM, January 1976.

Digital Library

Google Scholar

[15]

S. Horowitz, T. Reps, and D. Binkley. Interproccdural slicing using dependence graphs, in Proceedings of the A CM SIGPLAN 88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.

Digital Library

Google Scholar

[16]

P. Hudak. A semantic model of reference counting and its abstraction. In Conference Record of the 1986 Symposium on Lisp and Functional Programming, pages 351-363, 1986.

Digital Library

Google Scholar

[17]

J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. Journal of the A CM, 23(1):159-171, January 1976.

Digital Library

Google Scholar

[18]

K. Kennedy. Automatic translation of Fortran programs to vector form. Technical Report 476-029-4, Dept. of Mathematical Sciences, Rice University, October 1980.

Google Scholar

[19]

K. Kennedy. A survey of data flow analysis techniques. In S. S. Muchnick and M. D. Jones, editors, Program Flow Analysis: Theory and Applications, pages 1-54, Prentice-Hall,New Jersey, 1981.

Google Scholar

[20]

D. J. Kuck. The Structure of Computers and Computation. Volume 1, John Wiley & Sons, New York, 1978.

Digital Library

Google Scholar

[21]

D. Lomet. Data flow analysis in the presence of procedure calls. IBM Journal of Research and Development, 21(6):559-571, November 1977.

Digital Library

Google Scholar

[22]

E. Myers. A precise interprocedural data/tow algorithm. In Conference Record of the Eigth A CM Sttmposium on the Principles of Programming Languages, pages 219-230, January 1981.

Digital Library

Google Scholar

[23]

L. L. Pollock and M. L. Sofia. An incremental version of iterative data flow analysis. Rice COMP TR87-58, Dept. of Computer Science, Rice University, August 1987.

Google Scholar

[24]

B. K. Rosen. Data flow analysis for procedural languages. Journal ojf the A CM, 26(2):322-344, April 1979.

Digital Library

Google Scholar

[25]

B. G. Ryder and M. D. Carroll. An incremental algorithm for software analysis. In Proceedinqs of the A CM SIGSOFT/$IGPLAN Symposium on Practical SoItware Development Environments, pages 171-179, 1986.

Crossref

Google Scholar

[26]

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981.

Digital Library

Google Scholar

[27]

R. Triolet, F. Irigion, and P. Feautrier. Direct parallelization of call statements. In Proceedings of the $IGPLAN '86 Slimposium on Compiler Construction, pages 176-185, June 1986.

Digital Library

Google Scholar

Cited By

View all

Theodoridis TRigger MSu ZFalsafi BFerdman MLu SWenisch T(2022)Finding missed optimizations through the lens of dead code eliminationProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507764(697-709)Online publication date: 28-Feb-2022
https://dl.acm.org/doi/10.1145/3503222.3507764
Svacina JBushong VDas DCerny T(2021)A Comprehensive Enterprise System Metamodel for Quality AssuranceInformation Science and Applications10.1007/978-981-33-6385-4_23(245-252)Online publication date: 3-Apr-2021
https://doi.org/10.1007/978-981-33-6385-4_23
Zhao JBurke MSarkar VDubach CXue J(2018)Parallel sparse flow-sensitive points-to analysisProceedings of the 27th International Conference on Compiler Construction10.1145/3178372.3179517(59-70)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3178372.3179517
Show More Cited By

Index Terms

The program summary graph and flow-sensitive interprocedual data flow analysis

Recommendations

Semi-sparse flow-sensitive pointer analysis
POPL '09

Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-...
Semi-sparse flow-sensitive pointer analysis
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-...
Precise and scalable context-sensitive pointer analysis via value flow graph
ISMM '13: Proceedings of the 2013 international symposium on memory management

In this paper, we propose a novel method for context-sensitive pointer analysis using the value flow graph (VFG) formulation. We achieve context-sensitivity by simultaneously applying function cloning and computing context-free language reachability (...

Comments

Information & Contributors

Information

Published In

PLDI '88: Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation

June 1988

338 pages

ISBN:0897912691

DOI:10.1145/53990

Editor:
R. L. Wexelblat
Philips Laboratories, Briarcliff Manor, NY

ACM SIGPLAN Notices Volume 23, Issue 7
Proceedings of the SIGPLAN '88 conference on Programming language design and implementation
July 1988
338 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/960116
Issue’s Table of Contents

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI88

Sponsor:

SIGPLAN

PLDI88: SIGPLAN 88

June 20 - 24, 1988

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
1,274
Total Downloads

Downloads (Last 12 months)147
Downloads (Last 6 weeks)28

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Theodoridis TRigger MSu ZFalsafi BFerdman MLu SWenisch T(2022)Finding missed optimizations through the lens of dead code eliminationProceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3503222.3507764(697-709)Online publication date: 28-Feb-2022
https://dl.acm.org/doi/10.1145/3503222.3507764
Svacina JBushong VDas DCerny T(2021)A Comprehensive Enterprise System Metamodel for Quality AssuranceInformation Science and Applications10.1007/978-981-33-6385-4_23(245-252)Online publication date: 3-Apr-2021
https://doi.org/10.1007/978-981-33-6385-4_23
Zhao JBurke MSarkar VDubach CXue J(2018)Parallel sparse flow-sensitive points-to analysisProceedings of the 27th International Conference on Compiler Construction10.1145/3178372.3179517(59-70)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3178372.3179517
Deering TSanthanam GKothari S(2015)FlowMinerProceedings of the 11th International Conference on Information Systems Security - Volume 947810.1007/978-3-319-26961-0_11(171-191)Online publication date: 16-Dec-2015
https://dl.acm.org/doi/10.1007/978-3-319-26961-0_11
Zhao ZWu BZhou MDing YSun JShen XWu Y(2014)Call sequence prediction through probabilistic calling automataACM SIGPLAN Notices10.1145/2714064.266022149:10(745-762)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2714064.2660221
Zhao ZWu BZhou MDing YSun JShen XWu YBlack AMillstein T(2014)Call sequence prediction through probabilistic calling automataProceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications10.1145/2660193.2660221(745-762)Online publication date: 15-Oct-2014
https://dl.acm.org/doi/10.1145/2660193.2660221
Bae HMustafa DLee JAurangzeb Lin HDave CEigenmann RMidkiff S(2013)The Cetus Source-to-Source Compiler InfrastructureInternational Journal of Parallel Programming10.1007/s10766-012-0211-z41:6(753-767)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1007/s10766-012-0211-z
Acharya MRobinson BTaylor RGall HMedvidović N(2011)Practical change impact analysis based on static program slicing for industrial software systemsProceedings of the 33rd International Conference on Software Engineering10.1145/1985793.1985898(746-755)Online publication date: 21-May-2011
https://dl.acm.org/doi/10.1145/1985793.1985898
Rubio-González CGunawi HLiblit BArpaci-Dusseau RArpaci-Dusseau A(2009)Error propagation analysis for file systemsACM SIGPLAN Notices10.1145/1543135.154250644:6(270-280)Online publication date: 15-Jun-2009
https://dl.acm.org/doi/10.1145/1543135.1542506
Rubio-González CGunawi HLiblit BArpaci-Dusseau RArpaci-Dusseau AHind MDiwan A(2009)Error propagation analysis for file systemsProceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1542476.1542506(270-280)Online publication date: 15-Jun-2009
https://dl.acm.org/doi/10.1145/1542476.1542506
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Semi-sparse flow-sensitive pointer analysis

Semi-sparse flow-sensitive pointer analysis

Precise and scalable context-sensitive pointer analysis via value flow graph