An Implementation of an Iterative Global Flow Analysis Algorithm.

Abstract

Kildall has stated a general data flow analysis algorithm which has been applied to several forms of classical global program optimization. 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.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1975
Accession Number
ADA009570

Entities

People

  • Jack William Cowan

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Convergence
  • Heuristic Methods
  • Identities
  • Mathematical Analysis
  • Mathematics
  • Optimization

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Science.
  • Statistical inference.