Test monadic programs using state machine based models https://github.com/advancedtelematic/quickcheck-state-machine-distributed#readme

Latest on Hackage:0.0.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD2 licensed by Stevan Andjelkovic


Hackage Stackage Nightly Stackage LTS Build Status

quickcheck-state-machine-distributed is Haskell library for testing stateful, possibly distributed, programs. It’s based on QuickCheck, but differs from the Test.QuickCheck.Monadic approach in that it lets the user specify the correctness by means of a state machine based model using pre- and post-conditions. The advantage of the state machine approach is twofold: 1) specifying the correctness of your programs becomes less adhoc, and 2) you get testing for race conditions for free.

The combination of state machine based model specification and property based testing first appeared in Erlang’s proprietary QuickCheck. The quickcheck-state-machine-distributed library can be seen as an attempt to provide similar functionality to Haskell’s QuickCheck library.

The quickcheck-state-machine-distributed library builds upon ideas from the quickcheck-state-machine sister library. The most significant difference is that the former is based on the distributed-process library, hence the name. A more detailed comparison follows below.


See test/TicketDispenser.hs for a full example of how to implement and test a ticket dispenser – think of one of those machines in the pharmacy which gives you a piece of paper with your number in line on it.

This example also appears in the Testing a Database for Race Conditions with QuickCheck and Testing the Hard Stuff and Staying Sane [PDF, video] papers.

quickcheck-state-machine-distributed vs quickcheck-state-machine

Apart from the already mentioned difference that -distributed is based on distributed-processes, it’s also different in that it:

  • Decouples requests from responses (opening up the possibility for testing asynchronous interfaces);

  • Takes a more lightweight approach; no GADTs, no references (which hopefully makes the library easier to understand and use).


The quickcheck-state-machine-distributed library is still very experimental.

We would like to encourage users to try it out, and join the discussion of how we can improve it on the issue tracker!

See also

The README of the sister library quickcheck-state-machine library contains many links and examples that could be useful for a better understanding of this library and the underlying principles.


BSD-style (see the file LICENSE).


Changelog for quickcheck-state-machine-distributed

0.0.1 (2018-5-3)

  • Lower the lower bound of the QuickCheck dependency.

0.0.0 (2018-5-3)

  • Initial release.
comments powered byDisqus