Algorithms to locate errors using covering arrays

被引:8
|
作者
Martinez, Conrado [1 ]
Moura, Lucia [2 ]
Panario, Daniel [3 ]
Stevens, Brett [3 ]
机构
[1] Univ Politecn Cataluna, E-08028 Barcelona, Spain
[2] Univ Ottawa, Ottawa, ON, Canada
[3] Carleton Univ, Ottawa, ON, Canada
来源
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1007/978-3-540-78773-0_44
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
ln this paper, we define error locating arrays (ELAs), which can be used to locate faulty interactions between parameters or components in a software system. We give constructions of ELAs based on covering arrays. Under certain assumptions on the structure of the faulty interactions, we design and analyse efficient algorithms that locate errors. Under the assumption of known "safe values", our algorithm performs a number of tests that is polynomial in log k and d, where k is the number of parameters in the system and d is an upper bound on the number of faulty pairwise interactions. For the binary alphabet case, we provide an algorithm that does not require safe values and runs in expected polynomial time in log k whenever d is an element of O (log log k).
引用
收藏
页码:504 / +
页数:3
相关论文
共 50 条
  • [1] LOCATING ERRORS USING ELAs, COVERING ARRAYS, AND ADAPTIVE TESTING ALGORITHMS
    Martinez, Conrado
    Moura, Lucia
    Panario, Daniel
    Stevens, Brett
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (04) : 1776 - 1799
  • [2] Problems and algorithms for covering arrays
    Hartman, A
    Raskin, L
    DISCRETE MATHEMATICS, 2004, 284 (1-3) : 149 - 156
  • [3] Conditional expectation algorithms for covering arrays
    Colbourn, Charles J.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2014, 90 : 97 - 115
  • [4] Partial Covering Arrays: Algorithms and Asymptotics
    Sarkar, Kaushik
    Colbourn, Charles J.
    De Bonis, Annalisa
    Vaccaro, Ugo
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (06) : 1470 - 1489
  • [5] Partial Covering Arrays: Algorithms and Asymptotics
    Kaushik Sarkar
    Charles J. Colbourn
    Annalisa De Bonis
    Ugo Vaccaro
    Theory of Computing Systems, 2018, 62 : 1470 - 1489
  • [6] Partial Covering Arrays: Algorithms and Asymptotics
    Sarkar, Kaushik
    Colbourn, Charles J.
    de Bonis, Annalisa
    Vaccaro, Ugo
    Combinatorial Algorithms, 2016, 9843 : 437 - 448
  • [7] Metaheuristic algorithms for building Covering Arrays: A review
    Adriana Timana-Pena, Jimena
    Alberto Cobos-Lozada, Carlos
    Torres-Jimenez, Jose
    REVISTA FACULTAD DE INGENIERIA, UNIVERSIDAD PEDAGOGICA Y TECNOLOGICA DE COLOMBIA, 2016, 25 (43): : 31 - 45
  • [8] Problems and algorithms for covering arrays via set covers
    Kampel, Ludwig
    Leithner, Manuel
    Garn, Bernhard
    Simos, Dimitris E.
    THEORETICAL COMPUTER SCIENCE, 2019, 800 : 90 - 106
  • [9] Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
    Rodriguez-Tello, Eduardo
    Torres-Jimenez, Jose
    ARTIFICIAL EVOLUTION, 2010, 5975 : 86 - 97
  • [10] Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays
    Castoldi, Andre Guerino
    do Monte Carmelo, Emerson Luiz
    Moura, Lucia
    Panario, Daniel
    Stevens, Brett
    ALGEBRAIC INFORMATICS, CAI 2019, 2019, 11545 : 100 - 111