QuickCheck

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
• Formalizing ordinal partition relations using Isabelle/HOL
• Model-based fault injection for testing gray-box systems
• Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms
• Smart testing of functional programs in Isabelle
• 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
• Formal Approaches to Software Testing
• Combining test case generation and runtime verification
• Tests and proofs for custom data generators
• When is a function a fold or an unfold?
• Superposition with structural induction
• 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
• Automation for dependently typed functional programming
• Latent semantic analysis of game models using LSTM
• Controllable Combinatorial Coverage in Grammar-Based Testing
• Functional Testing in the Focal Environment
• Satisfiability modulo bounded checking
• An integrated framework for the diagnosis and correction of rule-based programs
• Model based testing with logical properties versus state machines
• 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
• A transformational approach to resource analysis with typed-norms
• Computing in Coq with infinite algebraic data structures
• Finding a middle ground for computer-aided cryptography
• On theorem prover-based testing
• Automated testing and debugging of SAT and QBF solvers
• Beginner's luck: a language for property-based generators
• Lemma discovery for induction. A survey
• Test Data Generation of Bytecode by CLP Partial Evaluation
• From LCF to Isabelle/HOL
• Scrap more boilerplate: reflection, zips, and generalised casts
• Mathematics of Program Construction
• A formal, resource consumption-preserving translation from actors with cooperative scheduling to Haskell
• TIP: tools for inductive provers
• A formal, resource consumption-preserving translation of actors to Haskell
• Generating constrained random data with uniform distribution
• Automatically generating counterexamples to naive free theorems
• The ACL2 Sedan theorem proving system
• Model finding for recursive functions in SMT
• Automated theory exploration for interactive theorem proving: an introduction to the Hipster system
• Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic
• Automatic proof and disproof in Isabelle/HOL
• Verifying an algorithm computing discrete vector fields for digital imaging
• Zeno: an automated prover for properties of recursive data structures
• What is the meaning of these constant interruptions?
• Hipster: integrating theory exploration in a proof assistant
• Foundational property-based testing
• Local algebraic effect theories
• A purely functional computer algebra system embedded in Haskell
• Scrap your boilerplate with class: extensible generic functions
• Tests and Proofs for Enumerative Combinatorics
• Finding Counter Examples in Induction Proofs
• Quick specifications for the busy programmer
• Implementation of Functional Languages
• Automatic Generation of Test Inputs for Mercury
• Finding race conditions in Erlang with quickcheck and PULSE
• A certified reduction strategy for homological image processing
• On the enumeration of closures and environments with an application to random generation
• Testing and Proving Distributed Algorithms in Constructive Type Theory
• An overview of Edison
• On the learnability of programming language semantics
• Testing and tracing lazy functional programs using QuickCheck and Hat
• Fully Automatic Testing with Functions as Specifications
• Every bit counts: the binary representation of typed data and programs
• Title not available (Why is that?)
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• A lightweight approach to datatype-generic rewriting
• Property-based testing for Spark Streaming
• Protocol combinators for modeling, testing, and execution of distributed systems
• Definite descriptions and Dijkstra's odd powers of odd integers problem
• Counting environments and closures
• Interleaving strategies
• Creating Transformations for Matrix Obfuscation
• Testing and debugging techniques for answer set solver development

This page was built for software: QuickCheck