Eliminating go to's while preserving program structure

DOI10.1145/48014.48021zbMath0662.68012OpenAlexW2059518671WikidataQ28315664 ScholiaQ28315664MaRDI QIDQ3813271

Lyle Ramshaw

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/48014.48021

zbMATH Keywords

reducibilityPascalprogram transformationscontrol structuresblock structureflow graphstructured programmingexit statementbreak statementgo to statementMesa

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (5)

Automatically replacing indices into parallel arrays with pointers to records ⋮ The Böhm–Jacopini Theorem Is False, Propositionally ⋮ A unifying theory of control dependence and its application to arbitrary program structures ⋮ Theoretical foundations of dynamic program slicing ⋮ Byte code level cross-compilation for developing web applications

This page was built for publication: Eliminating go to's while preserving program structure