Many techniques that can be used to test a sequential program are available. Although concurrent programs are used to solve a lot of problems, testing techniques for a concurrent program are relatively rare due to unpredictable program behavior of the concurrent program. There are two characteristics to the concurrent program : a sequential program activity and a concurrent program activity. In this thesis to model the concurrent program's sequential program activity we divide the concurrent program to a set of fragments. For each fragment we draw a control flow graph. To model the concurrent program's concurrent program activity we propose an extended rendezvous graph which illustrates a sumultaneous execution. In this thesis, as a method of developing test-cases for a concurrent program we first obtain definition-use chain which tests the concurrent program's sequential program activity by using the Harrold's algorithm for control flow graph. To test the concurrent program activity we adjust the obtained D-U chain by using the extended rendezvous graph. The adjusted D-U chains can be used as test-cases for the concurrent program.
