Wu, H;
Nie, C;
Petke, J;
Jia, Y;
Harman, M;
(2019)
A Survey of Constrained Combinatorial Testing.
arXiv.org
, Article 1908.02480.
(In press).
Preview |
Text
1908.02480.pdf - Published Version Download (1MB) | Preview |
Abstract
Combinatorial Testing (CT) is a potentially powerful testing technique, whereas its failure revealing ability might be dramatically reduced if it fails to handle constraints in an adequate and efficient manner. To ensure the wider applicability of CT in the presence of constrained problem domains, large and diverse efforts have been invested towards the techniques and applications of constrained combinatorial testing. In this paper, we provide a comprehensive survey of representations, influences, and techniques that pertain to constraints in CT, covering 129 papers published between 1987 and 2018. This survey not only categorises the various constraint handling techniques, but also reviews comparatively less well-studied, yet potentially important, constraint identification and maintenance techniques. Since real-world programs are usually constrained, this survey can be of interest to researchers and practitioners who are looking to use and study constrained combinatorial testing techniques.
| Type: | Article |
|---|---|
| Title: | A Survey of Constrained Combinatorial Testing |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | https://arxiv.org/abs/1908.02480 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10097406 |
Archive Staff Only
 |
View Item |
