Flow graph analysis using linear connected regions

Authors:
William C. Nylin, Jr.
Affiliations:
Associate Professor of Computer Science, Lamar University, Beaumont, Texas
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 12
Cited 1

Some Topics in Code Optimization

Journal of the ACM (JACM)
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)
Global Data Flow Analysis and Iterative Algorithms

Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis

Journal of the ACM (JACM)
Object code optimization

Communications of the ACM
The LRLTRAN compiler

Communications of the ACM
Analysis of a simple algorithm for global data flow problems

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Control flow analysis

Proceedings of a symposium on Compiler optimization
Global common subexpression elimination

Proceedings of a symposium on Compiler optimization
A study of code optimization using a general purpose optimizer

A study of code optimization using a general purpose optimizer
Structural reorganization of multipass computer programs

Structural reorganization of multipass computer programs
Programming languages and their compilers: Preliminary notes

Programming languages and their compilers: Preliminary notes

The use of APL in a concurrent data flow environment

APL '82 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept and properties of the basic code block are extended to a generalized code region whose control flow graph can be entered at only one node and exited at only one node. Algorithms are given for the determination of all such regions in a program and the associated data flow information. Also, some applications of these regions to global optimization and code motion are discussed.