Application of the goal invariant to the structuring of programs

Authors:
Janusz W. Laski
Affiliations:
Oakland University, Rochester, Michigan
Venue:
ACM SIGPLAN Notices
Year:
1982

Citing 5
Cited 0

Structured Programming with go to Statements

ACM Computing Surveys (CSUR)
A genealogy of control structures

Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
A hierarchical approach to program testing

ACM SIGPLAN Notices
On readability of programs with loops

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional rather than structural approach to conversion of a two-exit loop into a while loop is presented. The functions computed by the corresponding exits are formally specified and their union is analyzed to reveal the cause of its loop nonrealizability. The latter is removed by either redefining the domain/range of the constituent functions or by inclusion of the loop postludes into the loop specification. None of these methods changes the functionality of the original program because no new variables are introduced.