A predicate sequencing constraint logic(PSCL) is proposed to represent test purpose for testing of concurrent programs. The advantage of PSCL rests in its capability of expressing not only sequencing relationships among I/O events, but also data dependencies between event parameters. A PSCL-based symbolic test case generation method is also proposed to automatically derive symbolic test cases that incorporate given data dependency constraints as verdict conditions.Themethod works in a syntactic way without referring to concrete program states and the derived test cases allow for dynamic test data selection according to the response from the software under test. A case study shows the PSCL-based test case generation can achieve transition coverage with smaller number of test steps.