A backtracking search tool for constructing combinatorial test suites
- 31 October 2008
- journal article
- Published by Elsevier BV in Journal of Systems and Software
- Vol. 81 (10), 1681-1693
- https://doi.org/10.1016/j.jss.2008.02.034
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Orthogonal arrays of strength 3 and small run sizesJournal of Statistical Planning and Inference, 2006
- Products of mixed covering arrays of strength twoJournal of Combinatorial Designs, 2005
- Constructing test suites for interaction testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Generating small combinatorial test suites to cover input-output relationshipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Breaking Row and Column Symmetries in Matrix ModelsLecture Notes in Computer Science, 2002
- On the state of strength‐three covering arraysJournal of Combinatorial Designs, 2002
- Model-based testing in practicePublished by Association for Computing Machinery (ACM) ,1999
- Covering Arrays of Strength ThreeDesigns, Codes and Cryptography, 1999
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997
- t-Covering Arrays: Upper Bounds and Poisson ApproximationsCombinatorics, Probability and Computing, 1996