Notes on avoiding ``go to statements

DOI10.1016/0020-0190(71)90018-4zbMath1260.68047OpenAlexW2019738397MaRDI QIDQ1945039

Robert W. Floyd, Donald E. Knuth

Publication date: 30 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(71)90018-4

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (14)

On flowchart theories. I. The deterministic case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dijkstra graphs ⋮ An algebraic definition for control structures ⋮ Computation of resource requirements ⋮ Translatability of flowcharts into while programs ⋮ Analysis of structured programs ⋮ Theoretical foundations of dynamic program slicing ⋮ Program transformations and algebraic semantics ⋮ Unnamed Item ⋮ Program proving: KJumps and functions ⋮ Note sulla derivata di un programma

Cites Work

• Flow diagrams, turing machines and languages with only two formation rules

This page was built for publication: Notes on avoiding ``go to statements