Security Feature Measurement for Frequent Dynamic Execution Paths in Software System

The scale and complexity of software systems are constantly increasing, imposing new challenges for software fault location and daily maintenance. In this paper, the Security Feature measurement algorithm of Frequent dynamic execution Paths in Software, SFFPS, is proposed to provide a basis for improving the security and reliability of software. First, the dynamic execution of a complex software system is mapped onto a complex network model and sequence model. This, combined with the invocation and dependency relationships between function nodes, fault cumulative effect, and spread effect, can be analyzed. The function node security features of the software complex network are defined and measured according to the degree distribution and global step attenuation factor. Finally, frequent software execution paths are mined and weighted, and security metrics of the frequent paths are obtained and sorted. The experimental results show that SFFPS has good time performance and scalability, and the security features of the important paths in the software can be effectively measured. This study provides a guide for the research of defect propagation, software reliability, and software integration testing.

[1]  Wang Jian Model for Cascading Faults in Complex Software , 2011 .

[2]  Hai Le Vu,et al.  A new approach for network vulnerability analysis , 2008, 2008 33rd IEEE Conference on Local Computer Networks (LCN).

[3]  Xin Yan,et al.  A new method optimizing the subgraph centrality of large networks , 2016 .

[4]  Wang Bei Software Networks Nodes Impact Analysis of Complex Software Systems , 2013 .

[5]  Yong Deng,et al.  Degree centrality based on the weighted network , 2012, 2012 24th Chinese Control and Decision Conference (CCDC).

[6]  Bei-Yang Wang,et al.  Software Networks Nodes Impact Analysis of Complex Software Systems: Software Networks Nodes Impact Analysis of Complex Software Systems , 2014 .

[7]  Ayse Basar Bener,et al.  Mining trends and patterns of software vulnerabilities , 2016, J. Syst. Softw..

[8]  Claire Le Goues,et al.  Using Execution Paths to Evolve Software Patches , 2009, 2009 International Conference on Software Testing, Verification, and Validation Workshops.

[9]  Wu Xuguang,et al.  Research on centrality of node importance in scale-free complex networks , 2012, Proceedings of the 31st Chinese Control Conference.

[10]  Wang Ji,et al.  Shortest Path Approximate Algorithm for Complex Network Analysis , 2011 .

[11]  Shuang Xu,et al.  Identifying important nodes by adaptive LeaderRank , 2017 .

[12]  Massimo Riccaboni,et al.  Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Bing Li,et al.  Empirical Study on the Characteristics of Complex Networks in Networked Software: Empirical Study on the Characteristics of Complex Networks in Networked Software , 2011 .

[14]  Michalis Faloutsos,et al.  Graph-based analysis and prediction for software evolution , 2012, 2012 34th International Conference on Software Engineering (ICSE).

[15]  Jian Wang,et al.  Model for Cascading Faults in Complex Software: Model for Cascading Faults in Complex Software , 2011 .

[16]  Ji Wang,et al.  Shortest Path Approximate Algorithm for Complex Network Analysis: Shortest Path Approximate Algorithm for Complex Network Analysis , 2011 .

[17]  Ming Yang,et al.  Reliability analysis of Digital Instrumentation and Control software system , 2017 .

[18]  Jiadong Ren,et al.  Approach to mine influential functions based on software execution sequence , 2017, IET Softw..

[19]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[20]  Xiang-Yang Li,et al.  Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.