In: Computer Systems Science and Engineering Vol. 5, No. 2, pages 116-125. April 1990.
Abstract: In the paper, a systematic branch testing method for concurrent programs is proposed. Paths generated by the proposed method can be sensitized to obtain the necessary test data. In particular, the proposed method possesses generality, and is capable of detecting all dead codes and deadlocks due to incorrect program design. For evaluating different tests, two new coverage measures used for estimating the quality of testing concurrent programs are proposed. It is shown that to find optimal paths for branch testing of concurrent programs is NP-hard.
Keywords: branch testing; concurrent programs; dead code; deadlock; coverage measure.