Access Restriction

Author Peterson, W. W. ♦ Tokura, N. ♦ Kasami, T.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Go to statement ♦ Node splitting ♦ Repeat statement ♦ Exit statement ♦ While statement ♦ Software reliability ♦ Well-formed program ♦ Flowchart
Abstract A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition is given for a well-formed flowchart. It is shown that a program is well formed if and only if it can be written with if, repeat, and multi-level exit statements for sequence control. It is also shown that if, while, and repeat statements with single-level exit do not suffice. It is also shown that any flowchart can be converted to a well-formed flowchart by node splitting. Practical implications are discussed.
Description Affiliation: Univ. of Hawaii, Honolulu, HI (Peterson, W. W.) || Osaka Univ., Osaka, Japan (Kasami, T.; Tokura, N.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 8
Page Count 10
Starting Page 503
Ending Page 512

Open content in new tab

   Open content in new tab
Source: ACM Digital Library