Translatability of flowcharts into while programs

Journal of Computer and System SciencesPublished 1 October 1974

Takumi Kasai

DOI10.1016/s0022-0000(74)80006-1

Source URL

Citations17

SJR quartileQ1

SJR score1.03

SNIP1.08

TL;DR

This paper gives a necessary and sufficient condition for translatability of flowcharts into while programs.

Abstract

A “while program” [Z. Manna, “Introduction to Mathematical Theory of Computations,” to appear] is a simple abstract model of a “GOTO-less program.” Some flowcharts, however, can not be translated into while programs in a certain sense [D. E. Knuth and R. W. Floyd, Notes on avoiding GOTO statements, Information Processing Letters 1 (1971), 23–31]. That is, there exists a flowchart which is not “congruent” (or computation-sequence-equivalent) to any while program. In this paper we give a necessary and sufficient condition for translatability of flowcharts into while programs.

Keywords

Computer Science

HAL (Le Centre pour la Communication Scientifique Directe)Lecture Notes in Mathematics

10,101 Citations2011Stéphane Crépey, Olivier Guéant +4 more

Communications of the ACMAn axiomatic basis for computer programming

3,886 Citations1969C. A. R. Hoare

An attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics by elucidation of sets of axioms and rules of inference.

View PDF

Communications of the ACMAn axiomatic basis for computer programming

1,525 Citations1983C. A. R. Hoare

Communications of the ACMLetters to the editor: go to statement considered harmful

1,010 Citations1968Edsger W. Dijkstra

My considerations are that, although the programmer's activity ends when he has constructed a correct program, the process taking place under control of his program is the true subject matter of his activity, and that his intellectual powers are rather geared to master static relations and his powers to visualize processes evolving in time are relatively poorly developed.

View PDF

SIAM Journal on ComputingFlow Graph Reducibility

172 Citations1972Matthew S. Hecht, Jeffrey D. Ullman

Information Processing LettersNotes on avoiding “go to” statements

120 Citations1971D.E. Knuth, R.W. Floyd

Communications of the ACMBöhm and Jacopini's reduction of flow charts

48 Citations1967David C. Cooper

It is concluded from these authors that such a distinction is not fundamental to the structure of the language, given appropriate programming or "activity subroutines."

View PDF

Journal of the ACMThe Expression of Algorithms by Charts

40 Citations1972John Bruno, K. Steiglitz

The conclusion is that D- charts are in one technical sense more restrictive than general flowcharts, but not if one allows the introduction of additional variables which represent a history of control flow.

View PDF

Communications of the ACMLetters to the editor: The go to statement reconsidered

13 Citations1968John R. Rice, Edsger W. Dijkstra

To correct this, a call to procedure " scan" was inserted between lines 61 and 62, which also eliminates the need to position the input pointer at the first character prior to calling procedure "express ion" initially.

View PDF

Communications of the ACMA comment on Galler's letter

3 Citations1967Jerry A. Ralya

The importance of the techniques presented in this paper is the use of a digital computer to generate visual displays of the three-dimensional projections of the hyperobjects that could be produced most efficiently by a computer since the projections and drawing would be too tedious and impractical to produce by any other method.

View PDF