A Permutation Representation of Covering Arrays

Date
2021-05
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Abstract
Testing a large-scale system requires understanding how each of the components interact with each other, which is the subject of interaction testing. Covering arrays are a well-studied object, but “traditional” representations of these arrays in the context of genetic algorithms has not yielded much success. We propose a new representation of covering arrays based on a permutation of the rows considered. Preliminary results for reducing the mean-time-to-failure of these arrays are given.
Description
Keywords
Conferences, Genetics, Large-scale systems, Testing, Genetic algorithms
Citation
R. E. Dougherty and X. Jiang, "A Permutation Representation of Covering Arrays," 2021 IEEE/ACM International Workshop on Genetic Improvement (GI), Madrid, Spain, 2021, pp. 41-42, doi: 10.1109/GI52543.2021.00017.
URI
https://hdl.handle.net/20.500.14216/1001
DOI
https://doi/10.1109/gi52543.2021.00017
Collections
Works of Scholarship