Randomized post-optimization of covering arrays
- 1 January 2013
- journal article
- Published by Elsevier BV in European Journal of Combinatorics
- Vol. 34 (1), 91-103
- https://doi.org/10.1016/j.ejc.2012.07.017
Abstract
No abstract availableKeywords
Funding Information
- DOD (N00014-08-1-1069, N00014-08-1-1070)
This publication has 30 references indexed in Scilit:
- Covering arrays from cyclotomyDesigns, Codes and Cryptography, 2009
- IPO-s: Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering ArraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Constructing strength three covering arrays with augmented annealingDiscrete Mathematics, 2008
- A density‐based greedy algorithm for higher strength covering arraysSoftware Testing, Verification and Reliability, 2008
- Strength two covering arrays: Existence tables and projectionDiscrete Mathematics, 2008
- The density algorithm for pairwise interaction testingSoftware Testing, Verification and Reliability, 2007
- Constructing test suites for interaction testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the state of strength‐three covering arraysJournal of Combinatorial Designs, 2002
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997
- The complexity of completing partial Latin squaresDiscrete Applied Mathematics, 1984