Systematically Covering Input Structure

Full text DOI 10.1109/ase.2019.00027 dblp

Abstract

Grammar-based testing uses a given grammar to produce syntactically valid inputs. To cover program features, it is necessary to also cover input features-say, all URL variants for a URL parser. Our k-path algorithm for grammar production systematically covers syntactic elements as well as their combinations. In our evaluation, we show that this results in a significantly higher code coverage than state of the art.

BibTeX

@inproceedings{Havrikov-Zeller:ASE19,
  author    = {Nikolas Havrikov and
               Andreas Zeller},
  title     = {Systematically Covering Input Structure},
  booktitle = {ASE},
  pages     = {189--199},
  publisher = {{IEEE}},
  year      = {2019},
}

Systematically Covering Input Structure

Abstract

Related papers