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, a...

Full description

Saved in:
Bibliographic Details
Published inProceedings Fifth European Conference on Software Maintenance and Reengineering pp. 184 - 187
Main Authors Moretti, E., Chanteperdrix, G., Osorio, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2001
Subjects
Algorithm design and analysis
Assembly
Binary codes
Computer architecture
Computer industry
Embedded software
Graph theory
High level languages
Optimizing compilers
Performance evaluation
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0769510280
9780769510286
DOI:10.1109/CSMR.2001.914984