Generation and Visualization of Static Function Call Graph for Large C Codebases
Creators
- 1. Department of Computer Science, R.V. College of Engineering, Bengaluru (Karnataka), India.
Contributors
- 1. Publisher
Description
As software systems evolve, there is a growing concern on how to manage and maintain a large codebase and fully understand all the modules present in it. Developers spend a significant amount of time analyzing dependencies before making any changes into codebases. Therefore, there is a growing need for applications which can easily make developers comprehend dependencies in large codebases. These applications must be able to analyze large codebases and must have the ability to identify all the dependencies, so that new developers can easily analyze the codebase and start making changes in short periods of time. Static analysis provides a means of analyzing dependencies in large codebases and is an important part of software development lifecycle. Static analysis has been proven to be extremely useful over the years in their ability to comprehend large codebases. Out of the many static analysis methods, this paper focuses on static function call graph (SFCG) which represents dependencies between functions in the form of a graph. This paper illustrates the feasibility of many tools which generate SFCG and locks in on Doxygen which is extremely reliant for large codebases. The paper also discusses the optimizations, issues and its corresponding solutions for Doxygen. Finally, this paper presents a way of representing SFCG which is easier to comprehend for developers.
Files
F35070510521.pdf
Files
(518.5 kB)
Name | Size | Download all |
---|---|---|
md5:14c5dc2755e4ce9d18185b5f354a3938
|
518.5 kB | Preview Download |
Additional details
Related works
- Is cited by
- Journal article: 2231-2307 (ISSN)
Subjects
- ISSN
- 2231-2307
- Retrieval Number
- 100.1/ijsce.F35070510521