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.
Type de document :
Rapport
[Research Report] RR-2955, INRIA. 1996
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00073743
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:39:44
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:56:49

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

123

Téléchargements de fichiers

184