Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 3, 1972 - Issue 1-4
Submit an article Journal homepage
64
Views
34
CrossRef citations to date
0
Altmetric
Original Articles

A global flow analysis algorithm

Ken Kennedy Department of Mathematical Sciences, Rice University, Houston, Texas, 77001, USA
Pages 5-15 | Published online: 21 Dec 2010

Citations (34)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

S. Biswas, G.P. Bhattacharjee & P. Dhar. (1980) A comparison of some algorithms for live variable analysis. International Journal of Computer Mathematics 8:2, pages 121-134.
Read now
J. C. Beatty. (1975) An algorithm for tracing live variables based on a straightened program graph. International Journal of Computer Mathematics 5:1-4, pages 97-108.
Read now

Articles from other publishers (32)

Patrick Cousot. 2019. Static Analysis. Static Analysis 96 117 .
. 2012. Engineering a Compiler. Engineering a Compiler 765 785 .
Reinhard von Hanxleden & Ken Kennedy. (2000) A balanced code placement framework. ACM Transactions on Programming Languages and Systems 22:5, pages 816-860.
Crossref
K. Thulasiraman & M. N. S. Swamy. 1992. Graphs: Theory and Algorithms. Graphs: Theory and Algorithms 306 389 .
Michael Burke. (1990) An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Transactions on Programming Languages and Systems 12:3, pages 341-395.
Crossref
Thomas Gross & Peter Steenkiste. (2006) Structured dataflow analysis for arrays and its use in an optimizing compiler. Software: Practice and Experience 20:2, pages 133-155.
Crossref
P. Fairfield. (1985) STRAPS—a software transport system for low-level software. Journal of Systems and Software 5:4, pages 291-302.
Crossref
Jayashree Ramanathan & Ken Kennedy. (1981) Pathlistings applied to data flow analysis. Acta Informatica 16:3, pages 253-273.
Crossref
Aho. (1980) Translator Writing Systems: Where Do they Now Stand?. Computer 13:8, pages 9-14.
Crossref
John H. Reif. (1980) Code Motion. SIAM Journal on Computing 9:2, pages 375-395.
Crossref
Edmund M. Clarke & Lishing Liu. (1979) Approximate algorithms for optimization of busy waiting in parallel programs. Approximate algorithms for optimization of busy waiting in parallel programs.
J.C. Huang. (1979) Detection of Data Flow Anomaly Through Program Instrumentation. IEEE Transactions on Software Engineering SE-5:3, pages 226-236.
Crossref
Barry K. Rosen. (1979) Data Flow Analysis for Procedural Languages. Journal of the ACM 26:2, pages 322-344.
Crossref
John Cocke & Ken Kennedy. (1977) An algorithm for reduction of operator strength. Communications of the ACM 20:11, pages 850-856.
Crossref
Barry K. Rosen. (1977) High-level data flow analysis. Communications of the ACM 20:10, pages 712-724.
Crossref
John B. Kam & Jeffrey D. Ullman. (1977) Monotone data flow analysis frameworks. Acta Informatica 7:3, pages 305-317.
Crossref
A.V. Aho & J.D. Ullman. (1976) Node listings for reducible flow graphs. Journal of Computer and System Sciences 13:3, pages 286-299.
Crossref
R. Farrow, K. Kennedy & L. Zucconi. (1976) Graph grammars and global program data flow analysis. Graph grammars and global program data flow analysis.
Donald R. Innes & Shalom Tsur. (1976) Interval analysis, pagination and program locality. Information Processing Letters 5:4, pages 91-96.
Crossref
F. E. Allen & J. Cocke. (1976) A program data flow analysis procedure. Communications of the ACM 19:3, pages 137.
Crossref
Ken Kennedy. (1976) A Comparison of Two Algorithms for Global Data Flow Analysis. SIAM Journal on Computing 5:1, pages 158-180.
Crossref
A. V. Aho, J. E. Hopcroft & J. D. Ullman. (1976) On Finding Lowest Common Ancestors in Trees. SIAM Journal on Computing 5:1, pages 115-132.
Crossref
John Cocke & Ken Kennedy. (1976) Profitability computations on program flow graphs. Computers & Mathematics with Applications 2:2, pages 145-159.
Crossref
O. I. Rau. (1976) Allocation of segmented virtual memory. Cybernetics 11:1, pages 79-84.
Crossref
Matthew S. Hecht & Jeffrey D. Ullman. (1975) A Simple Algorithm for Global Data Flow Analysis Problems. SIAM Journal on Computing 4:4, pages 519-532.
Crossref
Cecil Kaplinsky. 1975. Parallel Processing. Parallel Processing 308 318 .
F. E. Allen. 1975. Programming Methodology. Programming Methodology 291 321 .
R. Endre Tarjan. (1974) Testing flow graph reducibility. Journal of Computer and System Sciences 9:3, pages 355-365.
Crossref
M. S. Hecht & J. D. Ullman. (1974) Characterizations of Reducible Flow Graphs. Journal of the ACM 21:3, pages 367-375.
Crossref
J. D. Ullman. (1973) Fast algorithms for the elimination of common subexpressions. Acta Informatica 2:3, pages 191-213.
Crossref
J. D. Ullman. (1972) A fast algorithm for the elimination of common subexpressions. A fast algorithm for the elimination of common subexpressions.
Matthew S. Hecht & Jeffrey D. Ullman. (1972) Flow Graph Reducibility. SIAM Journal on Computing 1:2, pages 188-202.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.