Graph Rewrite Systems for Program Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

Graph Rewrite Systems for Program Optimization


This paper demonstrates how graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems we develop some new rule-based criteria, defining {\em exhaustive graph rewrite systems}. We also define {\em stratification} of graph rewrite systems which automatically selects single normal forms for many non-deterministic systems. To illustrate the technology we specify parts of the lazy code motion optimization. For the resulting graph rewrite system classes a uniform evaluation algorithm is given. On the basis of this method the optimizer generator OPTIMIX has been developed. It is one of the first tools which can be used to specify analysis and transformation uniformly and we present compilation time results of generated optimizer components.
Fichier principal
Vignette du fichier
RR-2955.pdf (513.93 Ko) Télécharger le fichier

Dates and versions

inria-00073743 , version 1 (24-05-2006)


  • HAL Id : inria-00073743 , version 1


Uwe Assmann. Graph Rewrite Systems for Program Optimization. [Research Report] RR-2955, INRIA. 1996. ⟨inria-00073743⟩
97 View
546 Download


Gmail Facebook Twitter LinkedIn More