Eliminating go to's while preserving program structure

DOI10.1145/48014.48021MaRDI QIDQ3813271zbMATH OpenOpenAlexWikidataFDO

Authors 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

reducibilityblock structureprogram transformationsflow graphPascalstructured programmingcontrol structuresexit statementbreak statementgo to statementMesa

Mathematics Subject Classification ID

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

Recommendations

• Restructuring Pascal Programs Containing Goto Statements
• Program structures: Some new characterisations
• The Hierarchy of Program Control Structures
• Publication:4721624
• Goto elimination in program algebra

Cited in

(15)

• Goto elimination in program algebra
• The Böhm–Jacopini Theorem Is False, Propositionally
• The Hierarchy of Program Control Structures
• Theoretical foundations of dynamic program slicing
• Automatically replacing indices into parallel arrays with pointers to records
• Generalized structured programs and loop trees
• Jump Minimization in Linear Time
• Byte code level cross-compilation for developing web applications
• To use or not to use the goto statement: programming styles viewed from Hoare Logic
• An optimal algorithm for purging regular hammocks
• A unifying theory of control dependence and its application to arbitrary program structures
• Formal aspects of structured programming with goto statements
• scientific article; zbMATH DE number 3995021 (Why is no real title available?)
• scientific article; zbMATH DE number 3965407 (Why is no real title available?)
• Restructuring Pascal Programs Containing Goto Statements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813271)