Controllable Combinatorial Coverage in Grammar-Based Testing

DOI10.1007/11754008_2MaRDI QIDQ3434650zbMATH OpenOpenAlexFDO

Authors Wolfram Schulte, Ralf Lämmel

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11754008_2

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theory of software (68N99)

Recommendations

• Formal Methods for Components and Objects
• Test-data generation for control coverage by proof
• Solving Coverage Problems with Embedded Graph Grammars
• Testing for grammatical coverings
• A formal logic approach to constrained combinatorial testing

Cited in

(11)

• An Introduction to Grammar Convergence
• Solving Coverage Problems with Embedded Graph Grammars
• Automation of broad sanity test generation
• Using abstract models for the generation of test data with a complex structure
• Do judge a test by its cover. Combining combinatorial and property-based testing
• Test-data generation for control coverage by proof
• Geno
• A random testing approach using pushdown automata
• Two-dimensional approximation coverage
• scientific article; zbMATH DE number 1693521 (Why is no real title available?)
• Automated Generation of Positive and Negative Tests for Parsers

Describes a project that uses

Uses Software

• XPath
• AsmL
• QuickCheck
• Korat

This page was built for publication: Controllable Combinatorial Coverage in Grammar-Based Testing

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