The following pages link to SmallCheck (Q21715):
Displaying 18 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Tests and proofs for custom data generators (Q1624592) (← links)
- A purely functional computer algebra system embedded in Haskell (Q1798330) (← links)
- Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Exhaustive generation of atomic combinatorial differential operators (Q2449048) (← links)
- Model Finding for Recursive Functions in SMT (Q2817915) (← links)
- Tests and Proofs for Enumerative Combinatorics (Q2827441) (← links)
- Model Based Testing with Logical Properties versus State Machines (Q2830050) (← links)
- Zeno: An Automated Prover for Properties of Recursive Data Structures (Q2894285) (← links)
- Smart test data generators via logic programming (Q2909153) (← links)
- Automatic Proof and Disproof in Isabelle/HOL (Q3172879) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- The New Quickcheck for Isabelle (Q4916054) (← links)
- Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism (Q5108531) (← links)
- Generating constrained random data with uniform distribution (Q5371949) (← links)
- Improving Lazy Non-Deterministic Computations by Demand Analysis (Q5398051) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
