Automated Generation of Positive and Negative Tests for Parsers
From MaRDI portal
Recommendations
- Generation of positive and negative tests for parsers
- Automated generation of strictly conforming tests based on formal specification of dynamic semantics of the programming language
- Controllable Combinatorial Coverage in Grammar-Based Testing
- scientific article; zbMATH DE number 2079824
- Automatically generating test data from a Boolean specification
Cites work
- A sentence generator for testing parsers
- scientific article; zbMATH DE number 1693521 (Why is no real title available?)
- scientific article; zbMATH DE number 2084350 (Why is no real title available?)
- scientific article; zbMATH DE number 2084351 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- Recent Advances in Constraints
- Software is different
- Test generation for compilers and other formal text processors
- Two-dimensional approximation coverage
Cited in
(6)- Automated generation of strictly conforming tests based on formal specification of dynamic semantics of the programming language
- Generation of positive and negative tests for parsers
- scientific article; zbMATH DE number 1693521 (Why is no real title available?)
- Reachability analysis of the HTML5 parser specification and its application to compatibility testing
- scientific article; zbMATH DE number 1833419 (Why is no real title available?)
- Using abstract models for the generation of test data with a complex structure
This page was built for publication: Automated Generation of Positive and Negative Tests for Parsers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434611)