Classical search strategies for test case generation with Constraint Logic Programming
Alexander Pretschner · 2001
Test case generation for concurrent reactive systems on the grounds of symbolic execution basically amounts to searching their state space. As in the case of model checkers, di#erent search strategies (depth-first, breadth-first, best-first, tabu) together with di#erent strategies for storing visited states have a significant impact on the performance of the generation algorithm. We present experimental data for the performance of di#erent search strategies and discuss the results, taking into account counter examples as generated by model checkers.