Program Transformations Based on Assignment Motion

Abstract

After introducing the central notion of the second part, assignment motion, we sketch the main applications for assignment motion based program transformations: the elimination of partially dead (faint) assignments (cf. [KRS94b]), the elimination of partially redundant assignments and the uniform elimination of partially redundant assignments and expressions (cf. [KRS95]). It should be noted that the reasoning on properties of these transformations is postponed to Section 7, where a uniform framework for assignment motion based program transformations is presented.