Optimization of structured programs

Abstract

The class of programs which do not contain goto statements has a structure which lends itself to optimization by an optimizer that is fast, efficient and relatively easy to program. The design of such an optimizer is described, along with some of the results obtained using this optimizer—one such result being that very little code optimization is achieved. The conjecture is made that this is true because gotoless programming languages lend themselves to more compact and concise object code at the source language level.

Optimization Strategies for Integration Pattern Compositions

“…These kind of dependence graphs were also used by Böhm et al [35], however, they are "linearized" in the form of our pattern contracts. This makes the decision of the optimization "local" and does not require dependence graph abstractions like intervals [68] or scoping [69]. More recently these techniques have been applied for business process optimization by Sadiq [60], Niedermann et al [16,17] or reductions to process tree structures [70] with incremental transformations [71].…”