Improving and refining programs by program manipulation
Thomas A. Standish, Dennis F. Kibler, James M. Neighbors · ACM Annual Conference · 1976
By manipulating programs to reorganize the way they compute their results, it is possible to improve program performance in certain desirable directions. Further, using certain laws of exchange, it is possible to transform concise, abstract, high-level programs into efficient, concrete , underlying representations. This paper explores the notion of using source-to-source transformations interactively as a basis for an approach to program improvement and refinement. Examples of program manipulation are presented that convey both the flavor of the approach and its requirements.
Cited by 36 works. doi:10.1145/800191.805652 Open-access PDF
Authors
References
- structured programming
- An empirical study of FORTRAN programs
- The Theory of Parsing, Translation, and Compiling
- Program development by stepwise refinement
- Structured Programming with go to Statements
- APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This preprint is a preliminary version and is subject to modification prior to publication.
- Toward automatic program synthesis
- Program Improvement by Source-to-Source Transformation
- Towards a programming apprentice
- Application of Theorem Proving to Problem Solving