An implementation of an iterative global flow analysis algorithm
Loading...
Authors
Cowan, Jack William
Subjects
Global optimization
Program flow graph
Basic block
Meet operator
Code synthesis filter
Program flow graph
Basic block
Meet operator
Code synthesis filter
Advisors
Kildall, Gary A.
Date of Issue
1975-03
Date
March 1975
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
Kildall has states a general data flow analysis algorithm which has been applied to several forms of classical global program administration. The algorithm operates upon the flow graph of a program, where the nodes correspond to basic blocks and the edges represent possible program control flows. In order to test the effectiveness of this algorithm, a general purpose optimizing module was written in XPL which analyzes ALGOL-E programs for constant computations, common subexpressions and simplifying formal identities. Various node selection algorithms were investigated with respect to the convergence rate of the algorithm.
Type
Thesis
Description
Series/Report No
Department
Computer Science Group
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.