Subscription or Fee Access
Community Detection Algorithms Using Modularity on Function Call Network of Software
Networks, also called graphs mathematically, provide a useful representation of the structure of complex networks. We have focused on static analyses of Windows software by virtue of function calling and found them to reveal small-world, scale-free features similar to those identified in other sociological and technological systems. In this paper, we have pursued a community detecting approach to the study of software engineering at the function level. We first establish the Function Call Network of Software using an open source software system and then apply the greedy optimization for detecting the community structure to this network, which is based on the quality function known as ‘‘modularity’’ over the possible divisions of a network. This is first shown by identifying function communities in the Function Call Network of Software with 2290 functions linked by 22435 edges.
function-call graph, power-law distribution, modularity, community detection, greedy optimization.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.