By Topic

New algorithms for control-flow graph structuring

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Moretti, E. ; Res. Centre, RENAULT, Guyancourt, France ; Chanteperdrix, G. ; Osorio, A.

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

Published in:

Software Maintenance and Reengineering, 2001. Fifth European Conference on

Date of Conference:

2001