Advertisement

Program Transformations Based on Assignment Motion

Chapter
  • 98 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1539)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Personalised recommendations