An algorithm to find critical execution paths of software based on complex network
Guoyan Huang (),
Bing Zhang (),
Rong Ren () and
Jiadong Ren ()
Additional contact information
Guoyan Huang: College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
Bing Zhang: College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
Rong Ren: College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
Jiadong Ren: College of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, P. R. China;
International Journal of Modern Physics C (IJMPC), 2015, vol. 26, issue 09, 1-16
Abstract:
The critical execution paths play an important role in software system in terms of reducing the numbers of test date, detecting the vulnerabilities of software structure and analyzing software reliability. However, there are no efficient methods to discover them so far. Thus in this paper, a complex network-based software algorithm is put forward to find critical execution paths (FCEP) in software execution network. First, by analyzing the number of sources and sinks in FCEP, software execution network is divided into AOE subgraphs, and meanwhile, a Software Execution Network Serialization (SENS) approach is designed to generate execution path set in each AOE subgraph, which not only reduces ring structure's influence on path generation, but also guarantees the nodes' integrity in network. Second, according to a novel path similarity metric, similarity matrix is created to calculate the similarity among sets of path sequences. Third, an efficient method is taken to cluster paths through similarity matrices, and the maximum-length path in each cluster is extracted as the critical execution path. At last, a set of critical execution paths is derived. The experimental results show that the FCEP algorithm is efficient in mining critical execution path under software complex network.
Keywords: Complex network; critical execution path; path similarity; clustering; 89.75.Hc; 07.05.Tp; 01.50.hv (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183115501016
Access to full text is restricted to subscribers
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:26:y:2015:i:09:n:s0129183115501016
Ordering information: This journal article can be ordered from
DOI: 10.1142/S0129183115501016
Access Statistics for this article
International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann
More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().