Flowcharting loops without cycles

Authors:
N. H. Weiderman;B. M. Rawson
Affiliations:
University of Rhode Island, Kingston, Rhode Island;Federal Reserve Board of Govenors of the Federal Reserve System, Washington, D. C.
Venue:
ACM SIGPLAN Notices
Year:
1975

Citing 1
Cited 4

Flowchart techniques for structured programming

ACM SIGPLAN Notices

Applications of a graph grammar for program control flow analysis

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Teaching problem solving and structured programming in FORTRAN

SIGCSE '77 Proceedings of the seventh SIGCSE technical symposium on Computer science education
An interactive simulator for microprogram development

ANSS '78 Proceedings of the 11th annual symposium on Simulation
Flowcharting by stepwise refinement

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

In spite of recent progress in software engineering, many programmers continue to use flowcharting techniques which hamper rather than enhance their ability to create structured programs. This paper describes some of the problems of representing loops with existing techniques and suggests an alternative which solves these problems. The ideas presented here are meant to deal with some of the same issues which were raised by Nassi and Schneiderman [1] and Hopson and Dill [2] in a manner that is a natural out-growth from existing techniques.