Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the sorting comparison network (SCN). It is found that they both show the same scale-free property under certain conditions as complex networks in other fields. These results suggest that complex-network theory can be a useful approach to the study of software systems. The special properties of SCNs provide a more repeatable and deterministic way to study the evolution and optimization of complex networks. They also suggest that the closer a sorting algorithm is to the theoretical optimal limit, the more its SCN is like a scale-free network. This may also indicate that, to store and retrieve information efficiently, a concept network might need to be scale-free.
11 December 2024 in Expert Systems with Applications
As software systems become larger and more complex, in order to understand, manage and evolve these systems, we need better ways of characterizing and controlling their macroscopic properties. We suggest complex network theory may be useful for these purposes. In recent years, researchers have shown that many complex systems from different disciplines can be investigated as complex networks and most of them comply with a scale-free network model. We explore the view that a software system can be studied as a network with a number of components (classes) connected by dependency (integration) relationships; we call this network the component dependency network (CDN). The CDNs of several Java libraries and applications have been examined and all of them exhibit some scale-free characteristics. This result has some practical value including that it allows us to identify important components (classes) and thereby assists software maintenance and reengineering. We have built a tool to study software systems as complex networks. In the paper we also suggest ways of controlling and changing how systems evolve in order to improve their understandability and maintainability.
1 January 2014 in International Journal of Approximate Reasoning
Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the sorting comparison network (SCN). It is found that they both show the same scale-free property under certain conditions as complex networks in other fields. These results suggest that complex-network theory can be a useful approach to the study of software systems. The special properties of SCNs provide a more repeatable and deterministic way to study the evolution and optimization of complex networks. They also suggest that the closer a sorting algorithm is to the theoretical optimal limit, the more its SCN is like a scale-free network. This may also indicate that, to store and retrieve information efficiently, a concept network might need to be scale-free.