A Permutation Representation of Covering Arrays

dc.contributor.authorDougherty, Ryan E.
dc.contributor.authorJiang, Xi
dc.date.accessioned2023-10-24T19:16:57Z
dc.date.available2023-10-24T19:16:57Z
dc.date.issued2021-05
dc.description.abstractTesting 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.
dc.description.sponsorshipDepartment of Electrical Engineering and Computer Science
dc.identifier.citationR. 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.
dc.identifier.doihttps://doi/10.1109/gi52543.2021.00017
dc.identifier.urihttps://hdl.handle.net/20.500.14216/1001
dc.publisherIEEE
dc.relation.ispartof2021 IEEE/ACM International Workshop on Genetic Improvement (GI)
dc.subjectConferences
dc.subjectGenetics
dc.subjectLarge-scale systems
dc.subjectTesting
dc.subjectGenetic Algorithm
dc.titleA Permutation Representation of Covering Arrays
dc.typeproceedings-article
local.peerReviewedYes

Files