The power of assignment motion

  • Authors:

  • Jens Knoop;Oliver Rüthing;Bernhard Steffen

  • Affiliations:

  • Fakultät für Mathematik und Informatik, Universität Passau, Innstraβe 33, D-94032 Passau, Germany;Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität, Preuβerstraβe, 1-9, D-24105, Kiel, Germany;Fakultät für Mathematik und Informatik, Universität Passau, Innstraβe 33, D-94032 Passau, Germany

  • Venue:
  • PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Assignment motion (AM) and expression motion (EM) are the basis of powerful and at the first sight incomparable techniques for removing partially redundant code from a program. Whereas AM aims at the elimination of complete assignments, a transformation which is always desirable, the more flexible EM requires temporaries to remove partial redundancies. Based on the observation that a simple program transformation enhances AM to subsume EM, we develop an algorithm that for the first time captures all second order effects between AM and EM transformations. Under usual structural restrictions, the worst case time complexity of our algorithm is essentially quadratic, a fact which explains the promising experience with our implementation.