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

作　　者：LU Chao LU Yansheng 

机构地区：[1]College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China

出　　处：《Wuhan University Journal of Natural Sciences》2007年第6期1024-1028,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the "Tenth-Five Years" National Science Pre-Research Foundation of China (41315.9.2);the Natural Science Founda-tion of Hubei Province (2005ABA266)

摘　　要：Reachability testing is an approach to testing concurrent 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 proposed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated without 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.Reachability testing is an approach to testing concurrent 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 proposed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated without 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.

关 键 词：software testing reachability testing CONCURRENCY SYN-sequence 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]