In: Reinhard Wilhelm (editor), 10th International Conference on Compiler Construction, Lecture Notes in Computer Science 2027, pp. 52-68, 2001.

Authors: David Lacey and Oege de Moor
>

Abstract

We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expressions with simple patterns to matching blocks in a control flow graph. In order to express the complex restrictions on the applicability of these rewrites we add temporal logic side conditions. The combination of these features allows a flexible, high level, yet executable specification of many of the transformations found in optimising compilers.

(PDF, PS)

BIBTEX:

@InProceedings{laceydemoor01,
  author =    "David Lacey and Oege de Moor",
  title =    "Imperative Program Transformation by Rewriting",
  editor =   "R. Wilhelm ",
  volume =   2027,
  series =   "LNCS",
  pages =   "52-68",
  booktitle =  "Proceedings of the 10th International Conference on
      Compiler Construction",
  year =   2001,
  publisher =  "Springer Verlag"
}