Smallcheck and lazy smallcheck

Abstract

This paper describes two Haskell libraries for property-based testing. Following the lead of QuickCheck, these testing libraries SmallCheck and Lazy SmallCheck also use type-based generators to obtain test-sets of finite values for which properties are checked, and report any counter-examples found. But instead of using a sample of randomly generated values they test properties for all values up to some limiting depth, progressively increasing this limit. The paper explains the design and implementation of both libraries and evaluates them in comparison with each other and with QuickCheck.

Model Based Testing with Logical Properties versus State Machines

“…There are many variants of QuickCheck, such as [16] and [5]. Those test tools are based on logical properties and generate test cases based on the property to test.…”

Painless programming combining reduction and search

“…Good initialization abstracts over aggregates (allowing the user to declare one array, rather than many individual variables), and chooses good representations that minimize the problems to be solved. My approach to initialization was strongly influenced by the small check system [21] (which uses a type-based system to generate all "small" values of a given type) , and by conversations with Emina Torlak. Emina taught me the bounding trick for finite set initialization, and the importance of using symmetry in initialization.…”

Declarative Scripting in Haskell

“…Smallcheck [18] extends the idea behind QuickCheck by generating all the possible test inputs up to a certain depth in the type tree instead of just random ones. QuickCheck and SmallCheck are restricted to testing Haskell programs only.…”