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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. Siam Rev 51(4):661–703
Concas G, Marchesi M, Pinna S, Serra N (2007) Power-laws in a large object-oriented software system. IEEE Trans Softw Eng 33(10):687–708
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826
Guo Y, Liu ZW, Zhao ZX (2011) Complexity analysis on link structure of World Wide Web. Comput Eng 37(23):105–106 (Chinese)
Louridas P, Spinellis D, Vlachos V (2008) Power laws in software. ACM Trans Softw Eng Methodol 18(1):1–26
Myers CR (2003) Software systems as complex networks: structure, function, and evolvability of software collaboration graphs. Phys Rev E 68(4):61–76
Newman MEJ (2003) The structure and function of complex networks. Siam Rev 45(2):167–256
Newman MEJ (2004) Detecting community structure in networks. Eur Phys J B 38(2):321–330
Newman MEJ (2006a) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582
Newman MEJ (2006b) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):6104–6125
Newman MEJ (2010) Networks: an introduction. Oxford University Press, New York
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):6113–6128
Potanin A, Noble J, Frean M, Biddle R (2005) Scale-free geometry in object-oriented programs. Commun ACM 48(5):99–103
Valverde S, Ferrer-Cancho R, Sole R (2002) Scale-free networks from optimal design. Eur Phys Lett 60(4):512–517
Zhao Z, Lee ZZ (2008) Small-world phenomenon: toward an analytical model for data exchange in product lifecycle management. Int J Internet Manuf Serv 1(3):213–230
Acknowledgment
The work is funded by the NSFC Funding Council, the Peoples’ Republic of China, under the grant number 60873208.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Y., Zhao, Zx., Wang, W. (2013). Complexity Analysis of Software Based on Function-Call Graph. In: Qi, E., Shen, J., Dou, R. (eds) The 19th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37270-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-37270-4_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37269-8
Online ISBN: 978-3-642-37270-4
eBook Packages: Business and EconomicsBusiness and Management (R0)