QuickCheck
From MaRDI portal
Software:19322
swMATH7277MaRDI QIDQ19322FDOQ19322
Author name not available (Why is that?)
Cited In (88)
- Libraries for generic programming in Haskell
- Extended Static Checking by Calculation Using the Pointfree Transform
- Statistical properties of lambda terms
- Declarative debugging of concurrent Erlang programs
- Model-based fault injection for testing gray-box systems
- Model Finding for Recursive Functions in SMT
- Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms
- The ACL2 Sedan Theorem Proving System
- TIP: Tools for Inductive Provers
- Exhaustive generation of atomic combinatorial differential operators
- Testing your (static analysis) truths
- A core Erlang semantics for declarative debugging
- Zeno: An Automated Prover for Properties of Recursive Data Structures
- Verifying an Algorithm Computing Discrete Vector Fields for Digital Imaging
- Smart test data generators via logic programming
- Foundational Property-Based Testing
- Formal Approaches to Software Testing
- Automated Testing and Debugging of SAT and QBF Solvers
- Scrap your boilerplate with class
- Combining test case generation and runtime verification
- Automatic Proof and Disproof in Isabelle/HOL
- Tests and proofs for custom data generators
- Automatically Generating Counterexamples to Naive Free Theorems
- When is a function a fold or an unfold?
- Superposition with structural induction
- Formal Approaches to Software Testing
- 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
- Latent semantic analysis of game models using LSTM
- Controllable Combinatorial Coverage in Grammar-Based Testing
- Scrap more boilerplate
- A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell*
- Smart Testing of Functional Programs in Isabelle
- Functional Testing in the Focal Environment
- Satisfiability modulo bounded checking
- An integrated framework for the diagnosis and correction of rule-based programs
- Embedding of Systems of Affine Recurrence Equations in Coq
- Concolic testing in logic programming
- Computation semantics of the functional scientific workflow language Cuneiform
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Asymptotically almost all \lambda-terms are strongly normalizing
- Proof-guided test selection from first-order specifications with equality
- Finding a middle ground for computer-aided cryptography
- On theorem prover-based testing
- Automation for Dependently Typed Functional Programming
- Hipster: Integrating Theory Exploration in a Proof Assistant
- Beginner's luck: a language for property-based generators
- Model Based Testing with Logical Properties versus State Machines
- Lemma discovery for induction. A survey
- Test Data Generation of Bytecode by CLP Partial Evaluation
- From LCF to Isabelle/HOL
- Formalizing Ordinal Partition Relations Using Isabelle/HOL
- Mathematics of Program Construction
- A formal, resource consumption-preserving translation of actors to Haskell
- Generating constrained random data with uniform distribution
- The New Quickcheck for Isabelle
- A Transformational Approach to Resource Analysis with Typed-Norms
- Automated theory exploration for interactive theorem proving: an introduction to the Hipster system
- Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic
- Computing in Coq with Infinite Algebraic Data Structures
- What is the meaning of these constant interruptions?
- Local algebraic effect theories
- A purely functional computer algebra system embedded in Haskell
- Tests and Proofs for Enumerative Combinatorics
- Finding Counter Examples in Induction Proofs
- Quick specifications for the busy programmer
- Implementation of Functional Languages
- Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat
- Automatic Generation of Test Inputs for Mercury
- Property-Based Testing for Spark Streaming
- On the enumeration of closures and environments with an application to random generation
- Testing and Proving Distributed Algorithms in Constructive Type Theory
- Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem
- Title not available (Why is that?)
- Fully Automatic Testing with Functions as Specifications
- Finding race conditions in Erlang with QuickCheck and PULSE
- A Certified Reduction Strategy for Homological Image Processing
- Title not available (Why is that?)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Interleaving Strategies
- A lightweight approach to datatype-generic rewriting
- Protocol combinators for modeling, testing, and execution of distributed systems
- Every bit counts: The binary representation of typed data and programs
- Creating Transformations for Matrix Obfuscation
- An Overview of Edison
- Testing and debugging techniques for answer set solver development
- Title not available (Why is that?)
This page was built for software: QuickCheck