The following pages link to QuickCheck (Q19322):
Displayed 50 items.
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Combining test case generation and runtime verification (Q555778) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Proof-guided test selection from first-order specifications with equality (Q616851) (← links)
- Tests and proofs for custom data generators (Q1624592) (← links)
- Finding a middle ground for computer-aided cryptography (Q1662190) (← links)
- Superposition with structural induction (Q1687553) (← links)
- Automated theory exploration for interactive theorem proving: an introduction to the Hipster system (Q1687709) (← links)
- Model-based fault injection for testing gray-box systems (Q1734510) (← 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)
- Declarative debugging of concurrent Erlang programs (Q1994356) (← links)
- Testing your (static analysis) truths (Q2119122) (← links)
- Supervisory controller synthesis and implementation for safety PLCs (Q2128091) (← links)
- Automated generation of exam sheets for automated deduction (Q2128822) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Lemma discovery for induction. A survey (Q2287904) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- A core Erlang semantics for declarative debugging (Q2329440) (← links)
- Satisfiability modulo bounded checking (Q2405244) (← links)
- A formal, resource consumption-preserving translation of actors to Haskell (Q2409724) (← links)
- Latent semantic analysis of game models using LSTM (Q2423769) (← 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)
- Smart Testing of Functional Programs in Isabelle (Q2891447) (← links)
- Zeno: An Automated Prover for Properties of Recursive Data Structures (Q2894285) (← links)
- Verifying an Algorithm Computing Discrete Vector Fields for Digital Imaging (Q2907325) (← links)
- (Q2909153) (← links)
- Scrap your boilerplate with class (Q2936783) (← links)
- Finding race conditions in Erlang with QuickCheck and PULSE (Q2936812) (← links)
- Foundational Property-Based Testing (Q2945645) (← links)
- A Certified Reduction Strategy for Homological Image Processing (Q2946732) (← links)
- The ACL2 Sedan Theorem Proving System (Q3000661) (← links)
- Automation for Dependently Typed Functional Programming (Q3002482) (← links)
- A lightweight approach to datatype-generic rewriting (Q3070774) (← links)
- Every bit counts: The binary representation of typed data and programs (Q3165525) (← links)
- Automatic Proof and Disproof in Isabelle/HOL (Q3172879) (← links)
- Creating Transformations for Matrix Obfuscation (Q3392930) (← links)
- Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (Q3434613) (← links)
- Controllable Combinatorial Coverage in Grammar-Based Testing (Q3434650) (← links)
- A Transformational Approach to Resource Analysis with Typed-Norms (Q3453647) (← links)
- TIP: Tools for Inductive Provers (Q3460056) (← links)
- Automatically Generating Counterexamples to Naive Free Theorems (Q3558338) (← links)
- Embedding of Systems of Affine Recurrence Equations in Coq (Q3559765) (← links)
- Computing in Coq with Infinite Algebraic Data Structures (Q3582708) (← links)
- Testing and debugging techniques for answer set solver development (Q3585183) (← links)
- Test Data Generation of Bytecode by CLP Partial Evaluation (Q3617426) (← links)