An algorithm for hoisting

Authors:
John Crawford;Mehdi Jazayeri
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
ACM-SE 15 Proceedings of the 15th annual Southeast regional conference
Year:
1977

Citing 4
Cited 1

Flow Analysis of Computer Programs

Flow Analysis of Computer Programs
The Design of an Optimizing Compiler

The Design of an Optimizing Compiler
Module specifications for a program optimizer.

Module specifications for a program optimizer.
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)

A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)

Programmer productivity: program efficiency and improvement

ACM-SE 15 Proceedings of the 15th annual Southeast regional conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to hoisting, a program optimization technique, is discussed. The safety and profitability of optimization in general and hoisting in particular is analyzed. By restricting the analysis to a spanning tree imposed on the program graph, a linear algorithm is developed that provides sufficient but not necessary conditions for hoisting. This linear algorithm is shown to provide necessary and sufficient conditions for hoisting in IF-THEN-BLSE statements.