Improving and refining programs by program manipulation

  • Authors:
  • Thomas A. Standish;Dennis F. Kibler;James M. Neighbors

  • Affiliations:
  • -;-;-

  • Venue:
  • ACM '76 Proceedings of the 1976 annual conference
  • Year:
  • 1976

Quantified Score

Hi-index 0.03

Visualization

Abstract

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.