Mining the Key Nodes from Software Network Based on Fault Accumulation and Propagation

• Published in: Security and communication networks 2019-01, Vol.2019 (2019), p.1-11
• Main Authors: Hao, Xiaobing, Xinqian, Liu, Qian, Wang, Guoyan, Huang, Huaizhi, Yan
• Format: Article
• Language: English
• Subjects: Accumulation; Algorithms; Complexity; Mining; Nodes; Propagation; Recursive methods; Software development; Software quality
• ISSN: 1939-0114; 1939-0122
• DOI: 10.1155/2019/7140480

The increasement of software complexity directly results in the augment of software fault and costs a lot in the process of software development and maintenance. The complex network model is used to study the accumulation and accumulation of faults in complex software as a whole. Then key nodes with high fault probability and powerful fault propagation capability can be found, and the faults can be discovered as soon as possible and the severity of the damage to the system can be reduced effectively. In this paper, the algorithm MFS_AN (mining fault severity of all nodes) is proposed to mine the key nodes from software network. A weighted software network model is built by using functions as nodes, call relationships as edges, and call times as weight. Exploiting recursive method, a fault probability metric FP of a function, is defined according to the fault accumulation characteristic, and a fault propagation capability metric FPC of a function is proposed according to the fault propagation characteristic. Based on the FP and FPC, the fault severity metric FS is put forward to obtain the function nodes with larger fault severity in software network. Experimental results on two real software networks show that the algorithm MFS_AN can discover the key function nodes correctly and effectively.