A Language for Specifying Program Transformations

IEEE Transactions on Software Engineering

Volumn 16, Issue 6, 1990, Pages 630-638

  Hildum, David ^a   Cohen, Jacques ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

Optimization; pattern matching; program transformation; specification language

Indexed keywords

COMPUTER METATHEORY--PROGRAMMING THEORY;

ASSEMBLY LEVEL TRANSFORMATIONS; PROGRAM TRANSFORMATIONS; RULE SPECIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0025438149     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.55091     Document Type: Article

References (17)

1. A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
2. R. G. G. Cattell, “Automatic derivation of code generators from machine descriptions,” ACM Trans. Program. Lang. Syst., vol. 2, pp. 173–190, Apr. 1980.
3. W. F. Clocksin and C. S. Mellish, Programming in Prolog. New York: Springer-Verlag, 1981; 2nd ed., 1984.
4. J. Cohen and T. J. Hickey, “Parsing and compiling using Prolog,” ACM Trans. Program. Lang. Syst., vol. 9, pp. 125–163, Apr. 1987.
5. J. Cohen, R. Sitver, and D. Auty, “Evaluating and improving recursive descent parsers,” IEEE Trans. Software Eng., vol. SE-5, pp. 472–480, Sept. 1979.
6. J. Cohen, “Computer-assisted microanalysis of programs,” Commun. ACM, vol. 25, pp. 724–733, Oct. 1982.
7. R. E. Griswold, “Bibliography of documents related to the SNOBOL programming languages,” Dep. Comput. Sci., Univ. Arizona, Tucson, Tech. Rep. TR 78-18a, 1979.
8. —, “The control of searching and backtracking in string pattern matching,” in Implementations of Prolog, J. A. Campbell, Ed. New York: Wiley, 1984, pp. 50–64.
9. D. F. Kibler, J. M. Neighbors, and T. A. Standish, “Program manipulation via an efficient production system,” in Proc. Symp. Artificial Intelligence and Programming Languages, 1977, pp. 163–173.
10. D. B. Loveman, “Program improvement by source-to-source transformation,” J. ACM, vol. 24, pp. 121–145, Jan. 1977.
11. W. M. McKeeman, “Peephole optimization,” Commun. ACM, vol. 8, pp. 443–444, July 1965.
12. H. Partsch and R. Steinbriiggen, “Program transformation systems,” Comput. Surveys, vol. 15, pp. 199–236, Sept. 1983.
13. F. C. N. Pereira and D. H. D. Warren, “Definite clause grammars for language analysis,” Artificial Intell., vol. 13, pp. 231–278, 1980.
14. T. A. Standish, D. C. Harriman, D. F. Kibler, and J. M. Neighbors, The Irvine Program Transformation Catalogue. Irvine, CA: Dep. Comput. Sci., Univ. California, Jan. 1976.
15. L. Sterling and E. Shapiro, The Art of Prolog. Cambridge, MA: MIT Press, 1986.
16. A. S. Tanenbaum, H. van Staveren, and J. W. Stevenson, “Using peephole optimization on intermediate code,” ACM Trans. Program. Lang. Syst., vol. 4, pp. 21–36, Jan. 1982.
17. D. H. D. Warren, “Logic programming and compiler writing,” Software Practice and Experience, vol. 10, pp. 97–125, Feb. 1980.