QuickCheck: a lightweight tool for random testing of Haskell programs. QuickCheck is a tool which aids the Haskell programmer in formulating and testing properties of programs. Properties are discribed as Haskell functions, and can be automatically tested on random input, but it is also possible to define custom test data generators. We present a number of case studies, in which the tool was successfully used, and also point out some pitfalls to avoid. Random testing is especially suitable for functional programs because properties can be stated at a fine grain. When a function is built from separately tested components, then random testing suffuces to obtain good coverage of the definition under test.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 60 articles , 1 standard article )

Showing results 1 to 20 of 60.
Sorted by year (citations)

1 2 3 next

  1. Gerdes, Alex; Heeren, Bastiaan; Jeuring, Johan; van Binsbergen, L. Thomas: Ask-elle: an adaptable programming tutor for Haskell giving automated feedback (2017) MathEduc
  2. Paraskevopoulou, Zoe; Hriţcu, Cătălin; Dénès, Maxime; Lampropoulos, Leonidas; Pierce, Benjamin C.: Foundational property-based testing (2015)
  3. Rosén, Dan; Smallbone, Nicholas: TIP: tools for inductive provers (2015)
  4. Albert, Elvira; Genaim, Samir; Gutiérrez, Raúl: A transformational approach to resource analysis with typed-norms (2014)
  5. Amaral, Cláudio; Florido, Mário; Santos Costa, Vítor: Prologcheck -- property-based testing in prolog (2014)
  6. Groce, Alex; Havelund, Klaus; Holzmann, Gerard; Joshi, Rajeev; Xu, Ru-Gang: Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (2014)
  7. Johansson, Moa; Rosén, Dan; Smallbone, Nicholas; Claessen, Koen: Hipster: integrating theory exploration in a proof assistant (2014)
  8. Poza, María; Domínguez, César; Heras, Jónathan; Rubio, Julio: A certified reduction strategy for homological image processing (2014)
  9. Tremblay, Hugo; Labelle, Gilbert; Brlek, Srečko; Blondin Massé, Alexandre: Exhaustive generation of atomic combinatorial differential operators (2014)
  10. Brucker, Achim D.; Wolff, Burkhart: On theorem prover-based testing (2013)
  11. David, René; Grygiel, Katarzyna; Kozik, Jakub; Raffalli, Christophe; Theyssier, Guillaume; Zaionc, Marek: Asymptotically almost all $\lambda $-terms are strongly normalizing (2013)
  12. St-Amour, Vincent; Toronto, Neil: Experience report: applying random testing to a base type environment (2013) ioport
  13. Bulwahn, Lukas: Smart testing of functional programs in Isabelle (2012)
  14. Bulwahn, Lukas: The new quickcheck for isabelle. Random, exhaustive and symbolic testing under one roof (2012)
  15. Heras, Jónathan; Poza, María; Rubio, Julio: Verifying an algorithm computing discrete vector fields for digital imaging (2012)
  16. Kennedy, Andrew J.; Vytiniotis, Dimitrios: Every bit counts: the binary representation of typed data and programs (2012)
  17. Köksal, Ali Sinan; Kuncak, Viktor; Suter, Philippe: Constraints as control (2012) ioport
  18. Koopman, Pieter; Achten, Peter; Plasmeijer, Rinus: Model based testing with logical properties versus state machines (2012)
  19. Page, Rex: Property-based testing and verification: a catalog of classroom examples (2012) ioport
  20. Pita, Isabel; Riesco, Adrián: A tool for testing data type implementations from Maude algebraic specifications (2012) ioport

1 2 3 next