Mathematical construct for program reorganization

  • Authors:
  • D. P. Pazel

  • Affiliations:
  • IBM Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

A mathematical formalism is described through which a program is given a symbolic representation and, with the applihation of several basic formulas, may be transformed into an equivalent representation giving rise to a reorganized program. Examples are given in which programs are simplified (e.g., code is reduced) or reorganized into a structured form. In effect a mathematics is described that applies to programs in much the same manner as Boolean algebra applies to switching circuits.