Controllable combinatorial coverage in grammar-based testing

  • Authors:
  • Ralf Lämmel;Wolfram Schulte

  • Affiliations:
  • Microsoft Corp., Webdata/XML, Redmond;Microsoft Research, FSE Lab, Redmond

  • Venue:
  • TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a grammar (or other sorts of meta-data), one can trivially derive combinatorially exhaustive test-data sets up to a specified depth. Without further efforts, such test-data sets would be huge at the least and explosive most of the time. Fortunately, scenarios of grammar-based testing tend to admit non-explosive approximations of naive combinatorial coverage. In this paper, we describe the notion of controllable combinatorial coverage and a corresponding algorithm for test-data generation. The approach is based on a suite of control mechanisms to be used for the characterization of test-data sets as well-defined and understandable approximations of full combinatorial coverage. The approach has been implemented in the C#-based test-data generator Geno, which has been successfully used in projects that required differential testing, stress testing and conformance testing of grammar-driven functionality.