Class | Description |
---|---|
BFSHeuristic |
breadth first search
|
DFSHeuristic |
heuristic state prioritizer that favors search depth
|
GlobalSwitchThread |
heuristic state prioritizer that tries to minimize re-scheduling
|
HeuristicSearch |
a search strategy class that computes all immediate successors of a given
state, puts them into a priority queue (the priority is provided by a
Heuristic strategy object), and processes states in the sequence of
highest priorities.
|
HeuristicState |
wrapper for states that are processed in an order that is
defined by a heuristic (i.e.
|
Interleaving |
Heuristic to maximize thread interleavings.
|
MinimizePreemption |
a simple heuristic that tries to minimize preemptive scheduling, i.e.
|
MostBlocked |
Heuristic state prioriizer that maximizes number of blocked states.
|
PreferThreads |
a heuristic state prioritizer that favors certain threads (specified
by thread names during initialization)
<2do> for both efficiency and encapsulation reasons, this should be just
a Scheduler policy (so that we don't have to expand all children)
|
PrioritizedState |
HeuristicState with a scalar, static priority.
|
RandomHeuristic |
heuristic state prioritizer that returns random priority values
|
SimplePriorityHeuristic |
a heuristic that is based on static priorities that are determined
at state storage time
|
StaticPriorityQueue |
container for statically prioritized states, based on bounded
RB trees
TreeSet is a better choice than PriorityQueue since the size
constraint means we have to remove elements from both ends, which
is inefficient with heaps.
|
UserHeuristic |
heuristic state prioritizer that uses fields of the Main class under test
to determine priorities (i.e.
|