Modeling the growth of complex software function dependency networks

Information Systems Frontiers

Volumn 14, Issue 2, 2012, Pages 301-315

  Ma, James ^a,b   Zeng, Daniel ^a,c   Zhao, Huimin ^d  

^a UNIVERSITY OF ARIZONA   (United States)

^b Menlo College   (United States)

^c INSTITUTE OF AUTOMATION   (China)

^d UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

Cohesion and coupling; Complex networks; Network growth model; Software systems

Indexed keywords

COMPLEX NETWORK ANALYSIS; COMPLEX NETWORK MODELS; COMPLEX NETWORKS; COMPLEX SOFTWARE; DIVIDE AND CONQUER; EMPIRICAL ANALYSIS; INTER-MODULE; INTRA-MODULE; MODULARIZATIONS; NETWORK GROWTH; OPEN-SOURCE SOFTWARES; SOFTWARE SYSTEMS;

ADHESION; MODULAR CONSTRUCTION; SOFTWARE ENGINEERING;

SOFTWARE PACKAGES;

EID: 84861460684     PISSN: 13873326     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10796-010-9239-z     Document Type: Article

References (37)

1. Adamic, L. A. (2000). Zipf, power-laws, and Pareto - a ranking tutorial. Retrieved May 20, 2010, from http://www.hpl.hp.com/shl/papers/ranking/.
2. Albert, R., & Barabasi, A. L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47-97.
3. Amaral, L.A.N., Scala, A., Barthelemy,M.,&Stanley,H. E. (2000).Classes of small-world networks. Proceedings of the National Academy of Sciences of the United States of America, 97, 11149-11152.
4. Barabasi, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509-512.
5. Barabasi, A. L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A, 272, 173-187. (Pubitemid 30499165)
6. Barabasi, A. L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002). Evolution of the social network of scientific collaborations. Physica A, 311, 590-614. (Pubitemid 34782622)
7. Darcy, D. P., Kemerer, C. F., Slaughter, S. A., & Tomayko, J. E. (2005). The structural complexity of software: an experimental test. IEEE Transactions on Software Engineering, 31, 982-995.
8. Dhama, H. (1995). Quantitative models of cohesion and coupling in software. Journal of Systems and Software, 29, 65-74.
9. Dorogovtsev, S. N., & Mendes, J. F. F. (2001). Scaling properties of scale-free evolving networks: continuous approach. Physical Review E, 63, 056125.
10. Erdos, P., & Renyi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290-297.
11. Erdos, P., & Renyi, A. (1960). On the evolution of random graphs. Bulletin of the International Statistical Institute, 38, 343-347.
12. Erdos, P., & Renyi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12, 261-267.
13. Etzkorn, L., Davis, C., & Li, W. (1998). A practical look at the lack of cohesion in methods metric. Journal of Object-Oriented Programming, 11, 27-34. (Pubitemid 128637762)
14. Faloutsos, C., Faloutsos, P., & Faloutsos, M. (1999). On power law relationships of the Internet topology, in Proceedings of ACM SIGCOMM, vol. 12. Cambridge, MA, pp. 251-262. (Pubitemid 32081870)
15. Fothi, A., Nyeky-Gaizler, J., & Porkolab, Z. (2003). The structured complexity of object-oriented programs. Mathematical and Computer Modelling, 38, 815-827. (Pubitemid 37374957)
16. Harrison, R., Samaraweera, L. G., Dobie, M. R., & Lewis, P. H. (1996). Comparing programming paradigms: an evaluation of functional and object-oriented programs. Software Engineering Journal, 11, 247-254. (Pubitemid 126796303)
17. Hu, J. Q., Guo, C. G., Jia, Y., & Zou, P. (2005). Stratus: a distributed Web service discovery infrastructure based on double-overlay network. Web Technologies Research and Development - Apweb 2005, 3399, 1027-1032. (Pubitemid 41241519)
18. Kang, B. K., & Bieman, J. M. (1999). A quantitative framework for software restructuring. Journal of Software Maintenance- Research and Practice, 11, 245-284.
19. Kanmani, S., Uthariaraj, V. R., Sankaranarayanan, V., & Thambidurai, P. (2004). Measuring the object-oriented properties in small sized C++ programs - an empirical investigation. Product Focused Software Process Improvement, 3009, 185-202.
20. Kennel, E. B., Perry, M. S., & Donovan, B. D. (1989). Reliability and single point failure design considerations in thermionic space nuclear-power systems. Space Power, 8, 219-223.
21. Leino, K. R. M., & Nelson, G. (2002). Data abstraction and information hiding. ACM Transactions on Programming Languages and Systems, 24, 491-553. (Pubitemid 135694689)
22. Li, W., & Henry, S. (1993). Object-oriented metrics that predict maintainability. Journal of Systems and Software, 23, 111-122.
23. Li, Y., Zou, F. T., Wu, Z. D., & Ma, F. Y. (2004). PWSD: a scalable Web service discovery architecture based on peer-to-peer overlay network. Advanced Web Technologies and Applications, 3007, 291-300.
24. Milgram, S. (1967). Small-world problem. Psychology Today, 1, 61-67.
25. Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45, 167-256.
26. Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Physical Review E, 64, 026118.
27. Newman, M. E. J.,Watts, D. J., & Strogatz, S. H. (2002). Random graph models of social networks. Proceedings of the National Academy of Sciences of the United States of America, 99, 2566-2572. (Pubitemid 34165067)
28. Parnas, D. L. (1972a). Criteria to be used in decomposing systems into modules. Communications of the ACM, 15, 1053.
29. Parnas, D. L. (1972b). Technique for software module specification with examples. Communications of the ACM, 15, 330.
30. Potanin, A., Noble, J., Frean,M., & Biddle, R. (2005). Scale-free geometry in OO programs. Communications of the ACM, 48, 99-103. (Pubitemid 40672590)
31. Ravasz, E., & Barabasi, A. L. (2003). Hierarchical organization in complex networks. Physical Review E, 67, 026112.
32. Tonella, P. (2001). Concept analysis for module restructuring. IEEE Transactions on Software Engineering, 27, 351-363. (Pubitemid 32372190)
33. Wang, Y. H., Chung, C. M., Shih, T. K., Keh, H. C., & Chen, J. F. (2000). The complexity measurement of software through program decomposition. Computer Systems Science and Engineering, 15, 127-134.
34. Watts, D. J. (1999). Small worlds: The dynamics of networks between order and randomness. Cambridge: Cambridge Univ. Press.
35. Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of 'smallworld' networks. Nature, 393, 440-442.
36. Xu, J., Gao, Y., Christley, S., & Madey, G. (2005). A topological analysis of the open souce software development community, in 38th Hawaii International Conference on System Sciences (HICSS). Hawaii.
37. Zheng, X., Zeng, D., Li, H., & Wang, F. (2008). Analyzing opensource software systems as complex networks. Physica A: Statistical Mechanics and its Applications, 387, 6190-6200.