Iconic control graph representation

This paper presents a new representation of control flow graphs which is readable and concise, keeping all pertinent information as it appears in the source code. The iconic control graph provides an exact transformation of the source code. It is a basis for control flow visualization, unstructuredness identification, path crossing and path computation. The representation is programming‐language independent. The iconic control flow construction is automated.

[1]  Lawrence A. Rowe,et al.  A browser for directed graphs , 1987, Softw. Pract. Exp..

[2]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[3]  Martin R. Woodward,et al.  A Measure of Control Flow Complexity in Program Text , 1979, IEEE Transactions on Software Engineering.

[4]  Horst Zuse,et al.  Software complexity: Measures and methods , 1990 .

[5]  A. A. Kaposi,et al.  A Generalised Mathematical Theory of Structured Programming , 1985, Theor. Comput. Sci..

[6]  Ne Fenton,et al.  A note on the use of Z to specify flowgraph decomposition , 1988 .

[7]  Pierre N. Robillard,et al.  Profiling software through the use of metrics , 1991, Softw. Pract. Exp..

[8]  Chen Ding,et al.  A Framework for the Automated Drawing of Data Structure Diagrams , 1990, IEEE Trans. Software Eng..