Combination Reduction:A SYN-Sequence Selection Strategy for Reachability Testing of Concurrent Programs

摘要

Reachability testing is an approach to testing concur-rent programs, which can systematically exercise every partially ordered SYN-sequence without constructing the static model. In fact, not all the SYN-sequences need to be tested. This paper pro-posed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated with-out decreasing the effectiveness of detecting programs’ errors. We described a simple algorithm to implement the strategy, and then discussed several optimizations to the algorithm. Experiments have been carried out in a case study to verify the efficacy of the strategy.