Skip to main content
Erschienen in: Information Systems Frontiers 2/2012

01.04.2012

Modeling the growth of complex software function dependency networks

verfasst von: James Ma, Daniel Zeng, Huimin Zhao

Erschienen in: Information Systems Frontiers | Ausgabe 2/2012

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Software engineering efforts can potentially benefit much from a good understanding of the structures of existing software systems and the processes governing their development. Towards that end, we study software systems by means of the complex network analysis framework. We model a software package as a network, with nodes representing the functions in the package and edges representing the dependencies among the functions. Our empirical analysis of five widely-adopted open-source software packages reveals a set of interesting features of such networks, which cannot be adequately reproduced by existing complex network models. We then set out to develop a new network growth model, explicitly imitating generally-advocated software development principals, such as divide-and-conquer, modularization, high intra-module cohesion, and low inter-module coupling. Results of our analytical derivations and numeric studies show that our model can more closely reproduce the particular features exhibited by real-world software packages, thus hopefully better explaining the phenomena of concern.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Albert, R., & Barabasi, A. L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47–97.CrossRef Albert, R., & Barabasi, A. L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47–97.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Barabasi, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509–512.CrossRef Barabasi, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509–512.CrossRef
Zurück zum Zitat Barabasi, A. L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A, 272, 173–187.CrossRef Barabasi, A. L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A, 272, 173–187.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Dhama, H. (1995). Quantitative models of cohesion and coupling in software. Journal of Systems and Software, 29, 65–74.CrossRef Dhama, H. (1995). Quantitative models of cohesion and coupling in software. Journal of Systems and Software, 29, 65–74.CrossRef
Zurück zum Zitat Dorogovtsev, S. N., & Mendes, J. F. F. (2001). Scaling properties of scale-free evolving networks: continuous approach. Physical Review E, 63, 056125. Dorogovtsev, S. N., & Mendes, J. F. F. (2001). Scaling properties of scale-free evolving networks: continuous approach. Physical Review E, 63, 056125.
Zurück zum Zitat Erdos, P., & Renyi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290–297. Erdos, P., & Renyi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290–297.
Zurück zum Zitat Erdos, P., & Renyi, A. (1960). On the evolution of random graphs. Bulletin of the International Statistical Institute, 38, 343–347. Erdos, P., & Renyi, A. (1960). On the evolution of random graphs. Bulletin of the International Statistical Institute, 38, 343–347.
Zurück zum Zitat Erdos, P., & Renyi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12, 261–267.CrossRef Erdos, P., & Renyi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12, 261–267.CrossRef
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Fothi, A., Nyeky-Gaizler, J., & Porkolab, Z. (2003). The structured complexity of object-oriented programs. Mathematical and Computer Modelling, 38, 815–827.CrossRef Fothi, A., Nyeky-Gaizler, J., & Porkolab, Z. (2003). The structured complexity of object-oriented programs. Mathematical and Computer Modelling, 38, 815–827.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Kang, B. K., & Bieman, J. M. (1999). A quantitative framework for software restructuring. Journal of Software Maintenance-Research and Practice, 11, 245–284.CrossRef Kang, B. K., & Bieman, J. M. (1999). A quantitative framework for software restructuring. Journal of Software Maintenance-Research and Practice, 11, 245–284.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat 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. 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.
Zurück zum Zitat Leino, K. R. M., & Nelson, G. (2002). Data abstraction and information hiding. ACM Transactions on Programming Languages and Systems, 24, 491–553.CrossRef Leino, K. R. M., & Nelson, G. (2002). Data abstraction and information hiding. ACM Transactions on Programming Languages and Systems, 24, 491–553.CrossRef
Zurück zum Zitat Li, W., & Henry, S. (1993). Object-oriented metrics that predict maintainability. Journal of Systems and Software, 23, 111–122.CrossRef Li, W., & Henry, S. (1993). Object-oriented metrics that predict maintainability. Journal of Systems and Software, 23, 111–122.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Milgram, S. (1967). Small-world problem. Psychology Today, 1, 61–67. Milgram, S. (1967). Small-world problem. Psychology Today, 1, 61–67.
Zurück zum Zitat Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45, 167–256.CrossRef Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45, 167–256.CrossRef
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Parnas, D. L. (1972a). Criteria to be used in decomposing systems into modules. Communications of the ACM, 15, 1053.CrossRef Parnas, D. L. (1972a). Criteria to be used in decomposing systems into modules. Communications of the ACM, 15, 1053.CrossRef
Zurück zum Zitat Parnas, D. L. (1972b). Technique for software module specification with examples. Communications of the ACM, 15, 330.CrossRef Parnas, D. L. (1972b). Technique for software module specification with examples. Communications of the ACM, 15, 330.CrossRef
Zurück zum Zitat Potanin, A., Noble, J., Frean, M., & Biddle, R. (2005). Scale-free geometry in OO programs. Communications of the ACM, 48, 99–103.CrossRef Potanin, A., Noble, J., Frean, M., & Biddle, R. (2005). Scale-free geometry in OO programs. Communications of the ACM, 48, 99–103.CrossRef
Zurück zum Zitat Ravasz, E., & Barabasi, A. L. (2003). Hierarchical organization in complex networks. Physical Review E, 67, 026112. Ravasz, E., & Barabasi, A. L. (2003). Hierarchical organization in complex networks. Physical Review E, 67, 026112.
Zurück zum Zitat Tonella, P. (2001). Concept analysis for module restructuring. IEEE Transactions on Software Engineering, 27, 351–363.CrossRef Tonella, P. (2001). Concept analysis for module restructuring. IEEE Transactions on Software Engineering, 27, 351–363.CrossRef
Zurück zum Zitat 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. 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.
Zurück zum Zitat Watts, D. J. (1999). Small worlds: The dynamics of networks between order and randomness. Cambridge: Cambridge Univ. Press. Watts, D. J. (1999). Small worlds: The dynamics of networks between order and randomness. Cambridge: Cambridge Univ. Press.
Zurück zum Zitat Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442.CrossRef Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442.CrossRef
Zurück zum Zitat 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. 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.
Zurück zum Zitat Zheng, X., Zeng, D., Li, H., & Wang, F. (2008). Analyzing open-source software systems as complex networks. Physica A: Statistical Mechanics and its Applications, 387, 6190–6200.CrossRef Zheng, X., Zeng, D., Li, H., & Wang, F. (2008). Analyzing open-source software systems as complex networks. Physica A: Statistical Mechanics and its Applications, 387, 6190–6200.CrossRef
Metadaten
Titel
Modeling the growth of complex software function dependency networks
verfasst von
James Ma
Daniel Zeng
Huimin Zhao
Publikationsdatum
01.04.2012
Verlag
Springer US
Erschienen in
Information Systems Frontiers / Ausgabe 2/2012
Print ISSN: 1387-3326
Elektronische ISSN: 1572-9419
DOI
https://doi.org/10.1007/s10796-010-9239-z

Weitere Artikel der Ausgabe 2/2012

Information Systems Frontiers 2/2012 Zur Ausgabe

Premium Partner