A Survey of Rewriting Strategies in Program Transformation Systems (2001)
Cached
Download Links
| Venue: | In Workshop on Reduction Strategies in Rewriting and Programming (WRS’01), volume 57 of Electronic Notes in Theoretical Computer Science |
| Citations: | 20 - 1 self |
BibTeX
@INPROCEEDINGS{Visser01asurvey,
author = {Eelco Visser},
title = {A Survey of Rewriting Strategies in Program Transformation Systems},
booktitle = {In Workshop on Reduction Strategies in Rewriting and Programming (WRS’01), volume 57 of Electronic Notes in Theoretical Computer Science},
year = {2001},
pages = {2001},
publisher = {Elsevier Science Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Program transformation is used in a wide range of applications including compiler construction, optimization, program synthesis, refactoring, software renovation, and reverse engineering. Complex program transformations are achieved through a number of consecutive modifications of a program. Transformation rules define basic modifications. A transformation strategy is an algorithm for choosing a path in the rewrite relation induced by a set of rules. This paper surveys the support for the definition of strategies in program transformation systems. After a discussion of kinds of program transformation and choices in program representation, the basic elements of a strategy system are discussed and the choices in the design of a strategy language are considered. Several styles of strategy systems as provided in existing languages are then analyzed.
