By Topic

Mathematical Construct for Program Reorganization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pazel, D.P. ; IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598, USA

A mathematical formalism is described through which a program is given a symbolic representation and, with the application 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.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:19 ,  Issue: 6 )