Aiming at the problems of test case reduction(TCR) technology based on intelligent algorithms that it is easy to fall into local convergence and premature maturity, this paper proposed a test case set reduction algorithm based on per-survivor processing(PSP). The algorithm used the sequential grid search idea of PSP algorithm to binary code the test case set to form the state space of sequential grid search. In the state transition stage, the algorithm took the code coverage and the effective execution time of test cases as branch metrics. According to the calculation results, the path with the largest branch weight was the surviving path, so as to eliminate redundant states and complete the reduction of test case set. The experimental results show that under the same experimental environment, compared with other algorithms, this algorithm not only has higher redundancy rate(RR), but also ensures higher error detection rate(EDR). This algorithm reduces the complexity of software testing to a certain extent and improves the efficiency of software testing.

[2022-08-12] Accepted Paper /doc/2022.05.0260/v1

[2023-01-05] Printed Article /doc/2022.05.0260/v2