ASRSP——一种新的并发程序测试准则

可达性测试是目前较为成熟的一种并发程序测试方法,该方法解决了如何生成最小完备偏序测试序列集的问题.但研究表明,对于一般规模的并发程序,这一测试序列集仍然太大,以至穷尽测试无法完成.因此,目前亟需能投入实际应用的并发程序测试准则和相应的测试序列生成算法.本文提出了一种实用性较高的并发程序测试准则:全发送接收语句对(ASRSP),并针对该准则提出了一种新的并发程序测试方法:全发送接收语句对可达性测试(ASR-SP-RT).该方法利用可达性测试生成测试序列集的完备性来保证覆盖所有的发送接收语句对,并在每次生成新序列 之后及时去掉对覆盖剩下发送接收语句对无作用的序列,从而达到约简测试序列集的目的.

ASRSP: A New Testing Criterion for Concurrent Programs

Reachability testing is a general approach to testing concurrent programs via generating the minimal complete partial ordered set of test sequences.Recent work shows,however,that it generally suffers from its scalability due to the large set size.As a result,it is infeasible even for normal scale concurrent programs in practice.To address this problem,the necessity is to establish appropriate testing criterions as well as introduce corresponding algorithms to generate test sequences.In this paper,we present ASRSP,a testing criterion for concurrent programs.Based on ASRSP,we further present ASRSP-RT,a novel algorithm to generate test sequences.Our evaluation shows that compared to traditional methods,the proposed ASRSP-RT can significantly reduce the set the test sequences as a result of satisfying the ASRSP criterion.