An algorithmic search procedure for program generation

  • Authors:
  • M. H. Halstead;G. T. Uber;K. R. Gielow

  • Affiliations:
  • Lockheed Missiles and Space Company, Sunnyvale, California;Lockheed Missiles and Space Company, Sunnyvale, California;Lockheed Missiles and Space Company, Sunnyvale, California

  • Venue:
  • AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
  • Year:
  • 1967

Quantified Score

Hi-index 0.00

Visualization

Abstract

A programmer in writing and checking out an arithmetic computer program provides both a procedural description of the program and a set of numeric test cases. Similarly, a student of elementary physics is often given a set of formulae to be used, and correct answers to problems. These two inputs in both cases provide a redundancy which gives some measure of confidence that the procedure is correct. In theory either is adequate, subject to the limitations of induction. While compilers operate upon the first type of data, several programs have been written which use the second type.