The dpor package

[Tags:deprecated, library, mit]
Deprecated. in favor of dejafu

We can characterise the state of a concurrent computation by considering the ordering of dependent events. This is a partial order: independent events can be performed in any order without affecting the result. DPOR is a technique for computing these partial orders at run-time, and only testing one total order for each partial order. This cuts down the amount of work to be done significantly. In particular, this package implemented bounded partial-order reduction, which is a further optimisation. Only schedules within some *bound* are considered.

__Caution:__ The fundamental assumption behind DPOR is that the *only* source of nondeterminism in your program is the scheduler. Or, to put it another way, if you execute the same program with the same schedule twice, you get the same result. If you are using this library in combination with something which performs I/O, be *very* certain that this is the case!

See the README for more details.

For details on the algorithm, albeit presented in a very imperative way, see Bounded partial-order reduction, K. Coons, M. Musuvathi, and K. McKinley (2013), available at


Dependencies base (>=4.8 && <5), containers (==0.5.*), deepseq (>=1.3 && <1.5), random (>=1.0 && <1.2), semigroups (>=0.16 && <0.19) [details]
License MIT
Author Michael Walker
Category Testing
Home page
Source repository head: git clone
this: git clone dpor-
Uploaded Mon Jun 6 19:42:19 UTC 2016 by barrucadu
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 196 total (21 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2016-06-06 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees