SYN-sequence selection strategy for testing concurrent programs based on little strong happened-before

This paper defines a new relation—little strong happened-before(LSHB) and presents the algorithm for LSHB. Compared with strong happened-before (SHB) and weak happened-before (WHB), LSHB supports keeping-read-result and ensures definite sufficiency of testing. Equivalence partitioning the set of SYN-sequences based on LSHB can efficiently reduce the number of testing SYN-sequences. The case studies prove that LSHB has high practicability. Biography: PU Fangli(1970–), female, Ph. D. candidate, research direction: software testing theory and application.     

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

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.