Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On a proposed measure of program structure

On a proposed measure of program structure SIGPLAN Notices 1974 Ma y ON A PROPOSED MEASURE OF PROGRAM STRUCTUR E Amos N . Gileadi and Henry F . Ledgar d An important problem in quality software research is the measuremen t of certain objective properties of programs . We are concerned here with a measur e that we hope will tell us how " well-structured " a particular flowchart is wit h respect to the precepts of structured programming [3,8] . With such a measure, we could determine which of several flowcharts used t o describe a program is best from a structural point of view, rather than fro m the classical viewpoints : the least computation time or the least amount o f storage needed . To arrive at the proposed measure, we proceed through a serie s of transformations . They are described below mainly by example : for the general case see Gileadi [4] . The following paragraphs describe the mappings ; to PROGRAM to to FLOWCHART — AUTOMATION --®} MEASUR E 1 . PROGRAM FLOWCHAR T A flowchart composed of action-nodes, binary decision nodes, a STAR T node and END node is abstracted from an arbitrary program in the usual way http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGPLAN Notices Association for Computing Machinery

On a proposed measure of program structure

ACM SIGPLAN Notices , Volume 9 (5) – May 1, 1974

Loading next page...
 
/lp/association-for-computing-machinery/on-a-proposed-measure-of-program-structure-lN9edDDyVk

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1974 by ACM Inc.
ISSN
0362-1340
DOI
10.1145/987413.987417
Publisher site
See Article on Publisher Site

Abstract

SIGPLAN Notices 1974 Ma y ON A PROPOSED MEASURE OF PROGRAM STRUCTUR E Amos N . Gileadi and Henry F . Ledgar d An important problem in quality software research is the measuremen t of certain objective properties of programs . We are concerned here with a measur e that we hope will tell us how " well-structured " a particular flowchart is wit h respect to the precepts of structured programming [3,8] . With such a measure, we could determine which of several flowcharts used t o describe a program is best from a structural point of view, rather than fro m the classical viewpoints : the least computation time or the least amount o f storage needed . To arrive at the proposed measure, we proceed through a serie s of transformations . They are described below mainly by example : for the general case see Gileadi [4] . The following paragraphs describe the mappings ; to PROGRAM to to FLOWCHART — AUTOMATION --®} MEASUR E 1 . PROGRAM FLOWCHAR T A flowchart composed of action-nodes, binary decision nodes, a STAR T node and END node is abstracted from an arbitrary program in the usual way

Journal

ACM SIGPLAN NoticesAssociation for Computing Machinery

Published: May 1, 1974

There are no references for this article.