Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
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
ACM SIGPLAN Notices – Association for Computing Machinery
Published: May 1, 1974
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.