Generalized structured programs and loop trees
Science of Computer Programming
Using mathematics to improve ada compiled code, part 2: the proof
Proceedings of the 2007 ACM international conference on SIGAda annual international conference
Loop trees: a new theme in structured programming and discrete structures
Journal of Computing Sciences in Colleges
Removing backward go-to statements from Ada programs: possibilities and problems
Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference
| Hi-index | 0.00 |
According to a recently discovered theorem, the flow graph of any program, no matter how much "spaghetti code" it contains, may be reordered in such a way that it shows a loop structure. The rearranged program has no backward branches except for loopbacks, which go to the head of some loop from somewhere within that loop. No new vertices or variables are introduced; only the order of the vertices is changed. Rearrangement may be automated, for either low-level or high-level languages. We have constructed a tool, which we call a rearranger, to act on a description of an assembly language, followed by a program written in that language. A spaghetti-code version of depth-first search has been programmed for Intel, MIPS, G3, Motorola 68000, and the IBM mainframe, and successfully rearranged for all these machines.