Smallcheck and lazy smallcheck: automatic exhaustive testing for small values

Smallcheck and lazy smallcheck: automatic exhaustive testing for small values (2008)

by Colin Runciman , Matthew Naylor , Fredrik Lindblad

Venue:	In Haskell ’08: Proceedings of the first ACM SIGPLAN symposium on Haskell
Citations:	13 - 0 self

Datum	Value	Source
TITLE	Smallcheck and lazy smallcheck: automatic exhaustive testing for small values	INFERENCE
AUTHOR NAME	Colin Runciman	SVM HeaderParse 0.2
AUTHOR AFFIL	University of York, UK	SVM HeaderParse 0.2
AUTHOR NAME	Matthew Naylor	SVM HeaderParse 0.2
AUTHOR AFFIL	University of York, UK	SVM HeaderParse 0.2
AUTHOR NAME	Fredrik Lindblad	SVM HeaderParse 0.2
AUTHOR AFFIL	Chalmers University of Technology /; University of Gothenburg	SVM HeaderParse 0.2
AUTHOR ADDR	Sweden	SVM HeaderParse 0.2
ABSTRACT	This paper describes two Haskell libraries for property-based testing. Following the lead of QuickCheck (Claessen and Hughes 2000), 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. Categories and Subject Descriptors D.1.1 [Applicative (Functional)	SVM HeaderParse 0.2
YEAR	2008	INFERENCE
VENUE	In Haskell ’08: Proceedings of the first ACM SIGPLAN symposium on Haskell	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	37--48	INFERENCE
CITATIONS	21 found	ParsCit 1.0