Do judge a test by its cover. Combining combinatorial and property-based testing

DOI10.1007/978-3-030-72019-3_10zbMATH Open1473.68044OpenAlexW3137008396MaRDI QIDQ2233461FDOQ2233461

Yanyan Li

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_10

zbMATH Keywords

combinatorial testingalgebraic data typesproperty-based testingcombinatorial coverageQuickCheckregular tree expressions

Mathematics Subject Classification ID

Randomized algorithms (68W20) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Cites Work

• Secrets of the Glasgow Haskell Compiler inliner
• Beginner's luck: a language for property-based generators
• Controllable Combinatorial Coverage in Grammar-Based Testing
• Fundamental properties of infinite trees
• Title not available (Why is that?)
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• A survey of combinatorial testing
• Upper Bounds on the Size of Covering Arrays
• Applying formal methods: testing, performance, and M/E-commerce. FORTE 2004 workshops the FormEMC, EPEW, ITM, Toledo, Spain, October 1--2, 2004. Proceedings
• Generating constrained random data with uniform distribution

Cited In (1)

• Towards substructural property-based testing

This page was built for publication: Do judge a test by its cover. Combining combinatorial and property-based testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233461)