Analysis of structured programs

DOI10.1016/S0022-0000(74)80043-7zbMath0293.68014WikidataQ56571100 ScholiaQ56571100MaRDI QIDQ1212350

S. Rao Kosaraju

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (18)

On flowchart theories. I. The deterministic case ⋮ On the detection of unstructuredness in flowgraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note concerning top down program development and restricted exit control structures ⋮ Dijkstra graphs ⋮ An algebraic definition for control structures ⋮ Graph theoretic characterization of G-schemes and T L-schemes ⋮ Boolean-valued loops ⋮ Program structures: Some new characterisations ⋮ Dépliage d'un graphe pointé en un cactus ⋮ A generalized mathematical theory of structured programming ⋮ Correctness of parallel programs: The Church-Rosser approach ⋮ Analysis of Petri nets by stepwise refinements ⋮ Algebraic and graph theoretic characterizations of structured flowchart schemes ⋮ Information-logic connections in program schemes over arrays ⋮ Weak equivalence in a class of structured program schemes ⋮ An application of Cohen's result on star height to the theory of control structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on avoiding ``go to statements
• On the capabilities of while, repeat, and exit statements
• Flow diagrams, turing machines and languages with only two formation rules
• Syntax-directed documentation for PL360
• The Expression of Algorithms by Charts
• Flow Graph Reducibility

This page was built for publication: Analysis of structured programs