Eliminating go to's while preserving program structure
From MaRDI portal
Publication:3813271
DOI10.1145/48014.48021zbMath0662.68012WikidataQ28315664 ScholiaQ28315664MaRDI QIDQ3813271
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
reducibility; Pascal; program transformations; control structures; block structure; flow graph; structured programming; exit statement; break statement; go to statement; Mesa
68Q60: Specification and verification (program logics, model checking, etc.)
68N01: General topics in the theory of software
Related Items
A unifying theory of control dependence and its application to arbitrary program structures, Byte code level cross-compilation for developing web applications, Automatically replacing indices into parallel arrays with pointers to records, Theoretical foundations of dynamic program slicing, The Böhm–Jacopini Theorem Is False, Propositionally