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

DOI10.1007/978-3-030-72019-3_10zbMath1473.68044OpenAlexW3137008396MaRDI QIDQ2233461

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

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

Cites Work

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