QuickCheck

swMATH7277MaRDI QIDQ19322

No author found.

Related Items (88)

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

This page was built for software: QuickCheck