论文信息 - Program Proving: Exit and Return Jumps in Structured Programs

Program Proving: Exit and Return Jumps in Structured Programs

The inadequacy of goto-free programming languages to express algorithms has clearly been shown in the literature. On the other hand, the axiomatic definition of jumps is rather complex, and there aren’t complete or efficient proposals for it.

[1] Robert W. Floyd,et al. Notes on Avoiding "go to" Statements , 1971, Information Processing Letters.

[2] P. H. Lindsay. Human Information Processing , 1977 .

[3] Melvin Klerer. The economics, politics, and sociology of two-dimensional systems , 1972 .

[4] E. E. Grant,et al. Exploratory experimental studies comparing online and offline programming performance , 1968, CACM.

[5] Martin E. Hopkins,et al. A case for the GOTO , 1972, ACM '72.

[6] Corrado Böhm,et al. Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[7] Donald E. Knuth,et al. Structured Programming with go to Statements , 1974, CSUR.

[8] Niklaus Wirth,et al. On the Composition of Well-Structured Programs , 1974, CSUR.

[9] William A. Wulf,et al. Programming without the Goto , 1971, IFIP Congress.

[10] G. M. Stacey. The Role of Virtual Memory in the Handling of Application Files , 1971, Inf. Process. Lett..

[11] Charles T. Zahn,et al. A control statement for natural top-down structured programming , 1974, Symposium on Programming.

[12] William A. Wulf,et al. A case against the GOTO , 1972, ACM '72.

[13] Giorgio De Michelis,et al. Well Formed Programs Optimal with Respect to Structural Complexity , 1975, GI Jahrestagung.

[14] B. M. Leavenworth,et al. Programming with(out) the GOTO , 1972, SIGP.