Search and Partial Coverage: JPF supports well-known search strategies such as BFS and DFS as well as various heuristic-based searches such as A*, Best-First, and Beam Search. You can sum a number of heuristics during the search, and set search depth as well as the number of elements in the priority queue associated with searches such as simple BFS or the heuristic searches described above. Dynamic annotations in the source code can cause the model checker to increase or decrease heuristic values. Previous versions of JPF supported the calculation of structural coverage (branch and statement coverage) during model checking; coverage could also guide heuristic search. The current version of the tool however does not support these features. There are plans to include such facilities in the tool in the future.