Lucia Moura

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms

In this paper, we define and study error locating arrays (ELAs), which can be used in software testing for locating faulty interactions among parameters or components in a system. We give constructions of ELAs for arbitrary strength

Lower Bounds for Transversal Covers

t

Covering arrays avoiding forbidden edges

, based on covering arrays. We show that the number of tests given by ELAs grows as

A construction for strength-3 covering arrays from linear feedback shift register sequences

O(\log k)

Polyhedral Methods in Design Theory

, where

Constructing new covering arrays from LFSR sequences over finite fields

k

A Polyhedral Algorithm for Packings and Designs

is the number of parameters/components in the system, assuming other quantities (the number

Hardness results for covering arrays avoiding forbidden edges and error-locating arrays

g

Rank inequalities and separation algorithms for packing designs and sparse triple systems

of values per parameter, the strength

Finite field constructions of combinatorial arrays

t