We propose a new technique for automatic generation of test cases for
predicates. Earlier we proposed an efficient effective test generation
strategy for Boolean expressions. We now extend this strategy to pred
icates. Our new strategy addresses several issues, including: analysis
of dependencies between relational expressions in a predicate P, gene
ration of test constraints for P based on the detection of Boolean and
relational operator faults in P, generation of actual tests according
to the generated test constraints for P. We propose: the use of const
raint logic programming (CLP) to automate test-data generation for a p
redicate, an incremental approach to apply CLP techniques to solve a c
onstraint system. Since our technique is specification-based, it can f
acilitate generation of anticipated outputs for actual tests.