排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
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. 相似文献
2.
LU Chao LU Yansheng 《武汉大学学报:自然科学英文版》2007,12(6):1024-1028
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. 相似文献
1