Graph rewrite systems for program optimization
2000 (English)In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, Vol. 22, no 4, 583-637 p.Article in journal (Refereed) Published
Graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems several rule-based criteria are developed, defining exhaustive graph reunite systems. For nondeterministic systems stratification is introduced which automatically selects single normal forms. To illustrate hew far the methodology reaches, parts of the lazy code motion optimization are specified. The resulting graph rewrite system classes can be evaluated by a uniform algorithm, which forms the basis for the optimizer generator OPTIMIX. With this tool several optimizer components have been generated, and some numbers on their speed are presented.
Place, publisher, year, edition, pages
2000. Vol. 22, no 4, 583-637 p.
algorithms, languages, performance, theory, graph rewrite systems, compiler generators, program analysis, program optimization, program transformation, specification, stratification, very high-level languages, visual programming
IdentifiersURN: urn:nbn:se:liu:diva-49350OAI: oai:DiVA.org:liu-49350DiVA: diva2:270246