Engineering of the compiled software is an important task in software engineering. One of the stages of the engineering technologies is a construction and analysis of a control flow graphs, which reflect a general structure of algorithms. The paper presents a technique for analyzing and visualizing the control flow graph of a compiled software. The analysis is based on semantically equivalent transformations of the original graph resulting in an abstract node that contains a hierarchy of isolated regions, which then associated with predefined templates resulting a graphical representation. The templates and additional signature data allow one to recognize the high-level programming structures and user statements to construct a flow-chart notation of the original program.
['Andrey Mikhailov', 'Aleksey Hmelnov', 'E. A. Cherkashin', 'I. V. Bychkov']
Control flow graph visualization in compiled software engineering