Accession Number:

AD0781615

Title:

An Investigation of Selection Methods for a Simple Program Flow Analysis Algorithm.

Descriptive Note:

Master's thesis,

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF

Personal Author(s):

Report Date:

1974-06-01

Pagination or Media Count:

84.0

Abstract:

The problem of code optimization during compilation can be approached in different ways. Kildall conducted an analysis of the program structure to produce optimized object code during compilation. He used a directed graph to represent the program flow, along with an optimizing function, an optimizing pool and a meet operation. Based on these concepts, his program flow analysis algorithm collected corresponding graph elements on an investigation list and processed then those elements one at a time. The algorithm, as presented, does not specify a sequence in which these elements are selected from the list. The report investigates four selection methods Last In First Out, First In First Out, Steepest Descent, and Depth First Search, a method developed by Ullman. Modified author abstract

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE