QuickCheck
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Finding Counter Examples in Induction Proofs
- Quick specifications for the busy programmer
- Implementation of Functional Languages
- Libraries for generic programming in Haskell
- Automatic Generation of Test Inputs for Mercury
- Statistical properties of lambda terms
- Declarative debugging of concurrent Erlang programs
- Finding race conditions in Erlang with quickcheck and PULSE
- Extended Static Checking by Calculation Using the Pointfree Transform
- Model-based fault injection for testing gray-box systems
- Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms
- Formalizing ordinal partition relations using Isabelle/HOL
- Smart testing of functional programs in Isabelle
- A certified reduction strategy for homological image processing
- Exhaustive generation of atomic combinatorial differential operators
- Testing your (static analysis) truths
- A core Erlang semantics for declarative debugging
- Smart test data generators via logic programming
- On the enumeration of closures and environments with an application to random generation
- Combining test case generation and runtime verification
- Testing and Proving Distributed Algorithms in Constructive Type Theory
- Tests and proofs for custom data generators
- Formal Approaches to Software Testing
- An overview of Edison
- Superposition with structural induction
- When is a function a fold or an unfold?
- Formal Approaches to Software Testing
- The new Quickcheck for Isabelle. Random, exhaustive and symbolic testing under one roof
- Supervisory controller synthesis and implementation for safety PLCs
- Automated generation of exam sheets for automated deduction
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- On the learnability of programming language semantics
- Testing and tracing lazy functional programs using QuickCheck and Hat
- Automation for dependently typed functional programming
- Latent semantic analysis of game models using LSTM
- Fully Automatic Testing with Functions as Specifications
- Controllable Combinatorial Coverage in Grammar-Based Testing
- Every bit counts: the binary representation of typed data and programs
- Satisfiability modulo bounded checking
- Functional Testing in the Focal Environment
- scientific article; zbMATH DE number 2036335 (Why is no real title available?)
- An integrated framework for the diagnosis and correction of rule-based programs
- A lightweight approach to datatype-generic rewriting
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Model based testing with logical properties versus state machines
- Embedding of Systems of Affine Recurrence Equations in Coq
- Concolic testing in logic programming
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Proof-guided test selection from first-order specifications with equality
- GNT
- Nitpick
- Lutess
- COMBINE
- IMP++
- Haskell
- Kenzo
- CLISP
- FocalTest
- Erlang
- ATGen
- Euclide
- GATeL
- Korat
- TorX
- ACL2s
- HipSpec
- Zeno
- Curry
- Kima
- Kernel-LEAF
- Coq/SSReflect
- Camlflow
- TeaBag
- Rebeca
- Cayenne
- EasyCheck
- HaRe
- evt
- McErlang
- DPPD
- DDebugger
- SmallCheck
- LALBLC
- Galculator
- PLT Redex
- ELM-ART
- Sparkle
- Nighthawk
- Hipster
- AsmL
- SPARK Pro
- QuickChick
- criterion
- Freja
- Hood
- PrologCheck
- HUnit
- CodeSonar
- Klockwork
- PolyLib
This page was built for software: QuickCheck
