A solitary approach to test path prioritization using significance of centrality measures

This paper utilizes the significance of three centrality measures of a graph - Betweenness, Closeness and Degree of node in prioritizing the test cases. With the help of DD graph and graph centrality parameters, we propose an Importance Factor. Significant decision points and independent paths in the graph can be determined by analysing the values of this calculated Importance Factor for each node which may serve as a basis for test case prioritization. Since DD graph can also be used to get inferences for entry and exit criteria while forming test plan in testing phase, the proposed method would help largely in mitigating the expenses and time incurred during the testing of the software.

[1]  Xiaoxu Diao,et al.  Automated Software Testing , 2018, Analytic Methods in Systems and Software Testing.

[2]  U. Brandes A faster algorithm for betweenness centrality , 2001 .

[3]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[4]  Phillip Mafuta,et al.  Spanning paths in graphs , 2019, Discret. Appl. Math..

[5]  Frances E. Allen,et al.  Control-flow analysis , 2022 .