A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Decompiling high-level control structures with propositions
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Classification of malware using structured control flow
AusPDC '10 Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107
Traceability of executable codes using neural networks
ISC'10 Proceedings of the 13th international conference on Information security
| Hi-index | 0.00 |
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 same header node, and complex compound Boolean conditions are completely handled. With the described algorithms the generated high-level language code results easier to understand, what is subject to ease 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.