ASRSP:A New Testing Criterion for Concurrent Programs
Lu Yan · 2008
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.