Programs with minimal goto statements

A Formal Basis for Removing Goto Statements

Goto statements detract from the quality of imperative programs. They tend to make control-structures difficult to understand and, at the same time, introduce the risk of non-termination and other correctness problems. A new, formal, generally applicable procedure, for removing all goto statements from program structures is presented. This method, is based on formal semantics and congruent equi...

Taming Control Flow: A Structured Approach to Eliminating Goto Statements

1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract In designing optimizing and parallelizing compilers, ...

On Slicing of Programs with Input Statements

This paper studies program slicing in the presence of input statements. If unnecessary input statements are sliced away, the remaining input statements are assumed to read the same data as within the entire program. For specifying the relation of one program being a slice of another under this assumption, one needs a formalism for treating “stages of computation”. This paper presents an approac...

Analysing Ca he Memory Behaviour for Programs with IF Statements

Restructuring programs by tucking statements into functions

Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by decomposing large functions into small functions. Tuck consists of three steps: Wedge, Split, and Fold. A wedge—a subset of statements in a slice—contains computations that are related and that may create a meaningful ...