Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19]

@

Journal of Information Science and Engineering, Vol. 30 No. 4, pp. 1095-1113 (July 2014)


Statement-Coverage Testing for Concurrent Programs in Reachability Testing*


GWAN-HWAN HWANG, HENG-YI LIN, SHAO-YAN LIN AND CHE-SHENG LIN
Department of Computer Science and Information Engineering
National Taiwan Normal University
Taipei, 106 Taiwan

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.

Keywords: concurrent programs, nondeterministic behavior, concurrent testing, SYN-sequence, reachability testing, symbolic execution

Full Text () Retrieve PDF document (201407_10.pdf)

Received May 2, 2012; revised August 6, 2012; accepted August 16, 2012.
Communicated by Jonathan Lee.
* This work was supported in part by National Science Council, Taiwan, under grant NSC 100-2219-E-003-001.