Optimizing Programs Using Call Graphs

Authors

  • Kandala P Student, Department of CSE, Guru Nanak Institutions Technical Campus, Hyderabad
  • Kaur J Student, Department of CSE, Guru Nanak Institutions Technical Campus, Hyderabad
  • Narayana Rao T Professor, Department of CSE, Guru Nanak Institutions Technical Campus, Hyderabad, India

Keywords:

Call graph, cyclomat ic complexity, C program, optimality

Abstract

When working with complex software, visualization improves understanding considerably. Thus enhancing the ability of programmers to picture the relationships between components in a complex program not only saves time but becomes progressively mission- critical with increasing software complexity. Call Graph Generation Tool is a visualization tool which provides programmers different metrics to assess the software code. The different metrics include total n umber of lines in the function, total number of executable lines, number of unreachable lines, and cyclomatic complexity of the program. It provides a graphical representation of the function calls in a tree like structure. The tool accepts a „C‟ program and generates a funct ions call graph along with the functional metrics. The call graph generation tool provides both static and dynamic view. The whole programming is done using java technology. Thus, this tool helps the developer to know the program flow and thereby decide the optimality of the program. In situations where in, a single program is to be selected from available programs, this tool helps to figure out it. This paper depicts usage of call graph Generator to assess the reachability and exactness of the programs.

References

A J Sojev. "Basis Path Testing".

McCabe (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering: 308–320. Template:Working link

Belzer, Kent, Holzman and Williams (1992). Encyclopedia of Computer Science and Technology. CRC Press. pp. 367–368.

Harrison (October 1984). "Applying Mccabe's complexity measure to multiple -exit programs". Software: Practice and Experience (J

Wiley & Sons).

Diestel, Reinhard (2000). Graph theory. Graduate texts in mathematics 173 (2 ed.). New York: Springer. ISBN 0-387-98976-5.

McCabe (December 1976). "A Complexity Measure". IEEE Transactions on Software Engineering: 315.

McCabe, Watson (1996). "Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric".

John Sichi, JGraphT - Project Administrator.

Downloads

Published

2024-02-26

How to Cite

Kandala, P., Kaur, J., & Narayana Rao, T. (2024). Optimizing Programs Using Call Graphs. COMPUSOFT: An International Journal of Advanced Computer Technology, 3(02), 561–565. Retrieved from https://ijact.in/index.php/j/article/view/101

Issue

Section

Original Research Article

Similar Articles

<< < 1 2 3 4 5 6 > >> 

You may also start an advanced similarity search for this article.