Complexity Analysis of Software Based on Function-Call Graph

Yang Guo, Zheng-xu Zhao () and Wei Wang
Additional contact information
Yang Guo: Shandong University
Zheng-xu Zhao: Shijiazhuang Tiedao University
Wei Wang: Shijiazhuang Tiedao University

Chapter Chapter 26 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 269-277 from Springer

Abstract: Abstract The scientific study of networks, such as social networks, biological networks and computer networks, is an emerging filed. A large number of recent works have been devoted to the study of community structure and topology in networks. In this paper, we use a function-call graph reconstruction algorithm and present a complex network approach to the study of software engineering. We have examined a function-call graph of software system, and found it to reveal small-world, scale-free features which are similar to those identified in other technological, biological, and sociological systems. The result can contribute to the maintaining of software systems.

Keywords: Connected component; Function-call graph; Power-law distributions; Scale-free network; Small world effect (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-37270-4_26

Ordering information: This item can be ordered from
http://www.springer.com/9783642372704

DOI: 10.1007/978-3-642-37270-4_26

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().