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

Testing monadic code with QuickCheck

Koen Claessen (Institutionen för datavetenskap) ; John Hughes (Institutionen för datavetenskap)
ACM SIGPLAN Notices (0362-1340). Vol. 37 (2002), 12, p. 47-59.
[Konferensbidrag, refereegranskat]

QuickCheck is a previously published random testing tool for Haskell programs. In this paper we show how to use it for testing monadic code, and in particular imperative code written using the ST monad. QuickCheck tests a program against a specification: we show that QuickCheck's specification language is sufficiently powerful to represent common forms of specifications: algebraic, model-based (both functional and relational), and pre-/post-conditional. Moreover, all these forms of specification can be used directly for testing. We define a new language of monadic properties, and make a link between program testing and the notion of observational equivalence.

Denna post skapades 2013-01-14. Senast ändrad 2017-09-14.
CPL Pubid: 170517


Läs direkt!

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

Institutioner (Chalmers)

Institutionen för datavetenskap (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur