Classical Search Strategies for Test Case Generation with Constraint Logic Programming (2001)
Cached
Download Links
| Venue: | In Proc. Formal Approaches to Testing of Software |
| Citations: | 20 - 7 self |
BibTeX
@INPROCEEDINGS{Pretschner01classicalsearch,
author = {Alexander Pretschner},
title = {Classical Search Strategies for Test Case Generation with Constraint Logic Programming},
booktitle = {In Proc. Formal Approaches to Testing of Software},
year = {2001},
pages = {47--60},
publisher = {BRICS}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
