Abstrakt
When model checking a multi-threaded program, it is often necessary to enumerate the possible ordering of concurrent events to evaluate the behavior of the program. However, enumerating every possible order of events quickly leads to state-space explosion.
Dynamic Partial Order Reduction (DPOR) is a method to dynamically determine a subset of schedules that need to be evaluated to observe all the relevant behavior of a program. A sound implementation of DPOR in Java Pathfinder (JPF) can be tricky without incurring unacceptable amounts of overhead, because JPF does not support subdividing existing transitions.
Conservatively inserting choice generators to end transitions at each possible scheduling point causes JPF to save a large amount of state. We present an extension to JPF, which is an efficient implementation of DPOR that attempts to minimize spacial complexity.
It handles the directing of the search and uses a simple interface to allow the user to define the set of events to operate on and to determine which of those events are dependent. It keeps its own internal representation of all possible scheduling points without inserting choice generators at each point.
It then restarts portions of the search, if necessary, to insert only the needed choice generators.