Skip to Main content Skip to Navigation
Reports

Graph Rewrite Systems for Program Optimization

Abstract : 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.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00073743
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:39:44 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:56:49 PM

Identifiers

  • HAL Id : inria-00073743, version 1

Collections

Citation

Uwe Aßmann. Graph Rewrite Systems for Program Optimization. [Research Report] RR-2955, INRIA. 1996. ⟨inria-00073743⟩

Share

Metrics

Record views

274

Files downloads

620