Statement-Coverage Testing for Concurrent Programs in Reachability Testing.

In this paper we propose a scheme for reachability testing to achieve statement coverage in the dynamic testing of concurrent programs. Previous studies on reachability testing have only enumerated the feasible interleavings of a concurrent program for a given input. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program. We prove formally that the proposed method can achieve statement-coverage testing if all the path conditions derived from SYN-sequences can be solved and the concurrent program contains no dead code.