New algorithms for control-flow graph structuring

New algorithms for the structuring of arbitrary control-flow graphs are presented. As they minimize the use of Gotos, these algorithms are adequate for the control-flow analysis needed in the process of decompilation: loops are properly identified even when nested loops share the some header node, and complex compound Boolean conditions are completely handled. With the described algorithms, the generated high level language code results are easier to understand, which eases the maintenance of legacy code. The presented techniques have been implemented and have proved successful in their aim of structuring decompiled graphs from a variety of industrial real time embedded software on diverse architectures.