CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values

Fredrik Lindblad (Institutionen för data- och informationsteknik (Chalmers)) ; Matthew Naylor ; Colin Runciman
ACM SIGPLAN NOTICES (0362-1340). Vol. 44 (2008), 2, p. 37-48.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: Applicative (Functional) Programming, Testing and Debugging



Denna post skapades 2010-02-10. Senast ändrad 2015-01-09.
CPL Pubid: 111867

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik (Chalmers)

Ämnesområden

Datalogi

Chalmers infrastruktur