Tests and proofs for custom data generators
From MaRDI portal
Recommendations
- Tests and Proofs for Enumerative Combinatorics
- Smart test data generators via logic programming
- Beginner's luck: a language for property-based generators
- Generating constrained random data with uniform distribution
- The new Quickcheck for Isabelle. Random, exhaustive and symbolic testing under one roof
Cites work
- scientific article; zbMATH DE number 3156373 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- A Combinatorial Interpretation of the Seidel Generation of Genocchi Numbers
- A new Euler-Mahonian constructive bijection
- A permutation code preserving a double Eulerian bistatistic
- A permutations representation that knows what ``Eulerian means
- A verified algorithm enumerating event structures
- An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
- Beginner's luck: a language for property-based generators
- Combinatorial Oriented Maps
- Constructing permutation arrays from groups
- Counting rooted maps by genus. I
- Design and formal proof of a new optimal image segmentation program with hypermaps
- Designing and proving correct a convex hull algorithm with hypermaps in Coq
- Formal Matrix Integrals and Combinatorics of Maps
- Foundational property-based testing
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Gray code for permutations with a fixed number of cycles
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Lehmer code transforms and Mahonian statistics on permutations
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Patterns in permutations and words.
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
- Pragmatic quotient types in Coq
- Quantum contextual finite geometries from dessins d'enfants
- Ranking/unranking of lambda terms with compressed de Bruijn indices
- Recent progress in enumeration of hypermaps
- Satisfiability modulo bounded checking
- Tests and Proofs for Enumerative Combinatorics
- The Four Colour Theorem: Engineering of a Formal Proof
- The new Quickcheck for Isabelle. Random, exhaustive and symbolic testing under one roof
- Why3 -- where programs meet provers
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: Tests and proofs for custom data generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1624592)
