diff options
| author | Cristian Cadar <c.cadar@imperial.ac.uk> | 2016-11-19 20:34:23 +0000 |
|---|---|---|
| committer | Cristian Cadar <c.cadar@imperial.ac.uk> | 2016-11-19 20:34:23 +0000 |
| commit | d85f81ce5cf60817550f200a69923e47a8e0792c (patch) | |
| tree | 4445ed956c973d499ea7be7dd140d3523aaf387e | |
| parent | 30682e4b5171e3d32deea0400b1e706fc68e6775 (diff) | |
| download | klee-d85f81ce5cf60817550f200a69923e47a8e0792c.tar.gz | |
Documented the level at which BFS operates in KLEE, as part of --help
| -rw-r--r-- | lib/Core/UserSearcher.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Core/UserSearcher.cpp b/lib/Core/UserSearcher.cpp index 0aa4a4b0..725836e8 100644 --- a/lib/Core/UserSearcher.cpp +++ b/lib/Core/UserSearcher.cpp @@ -22,7 +22,7 @@ namespace { cl::list<Searcher::CoreSearchType> CoreSearch("search", cl::desc("Specify the search heuristic (default=random-path interleaved with nurs:covnew)"), cl::values(clEnumValN(Searcher::DFS, "dfs", "use Depth First Search (DFS)"), - clEnumValN(Searcher::BFS, "bfs", "use Breadth First Search (BFS)"), + clEnumValN(Searcher::BFS, "bfs", "use Breadth First Search (BFS), where scheduling decisions are taken at the level of (2-way) forks"), clEnumValN(Searcher::RandomState, "random-state", "randomly select a state to explore"), clEnumValN(Searcher::RandomPath, "random-path", "use Random Path Selection (see OSDI'08 paper)"), clEnumValN(Searcher::NURS_CovNew, "nurs:covnew", "use Non Uniform Random Search (NURS) with Coverage-New"), |