Cited in
(41)- Exhaustive generation of atomic combinatorial differential operators
- Smart test data generators via logic programming
- Tests and proofs for custom data generators
- The new Quickcheck for Isabelle. Random, exhaustive and symbolic testing under one roof
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Model based testing with logical properties versus state machines
- CLISP
- Ivor
- FocalTest
- QuickCheck
- KiCS2
- Alfalfa
- Camlflow
- iTasks
- EasyCheck
- AoPA
- QuickChick
- criterion
- Luck
- vZ
- computational-algebra
- DoCon
- ghc-typelits-presburger
- type-natural
- CHR.js
- FlatCurry
- nofib
- PFLP
- Mathematical Components
- Improving lazy non-deterministic computations by demand analysis
- αCheck: A mechanized metatheory model checker
- From LCF to Isabelle/HOL
- Generating constrained random data with uniform distribution
- Model finding for recursive functions in SMT
- Automatic proof and disproof in Isabelle/HOL
- Zeno: an automated prover for properties of recursive data structures
- A purely functional computer algebra system embedded in Haskell
- Tests and Proofs for Enumerative Combinatorics
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- Implementing a library for probabilistic programming using non-strict non-determinism
This page was built for software: SmallCheck
