Problems and algorithms for covering arrays

Alan Hartman; Leonid Raskin

doi:10.1016/j.disc.2003.11.029

Problems and algorithms for covering arrays

Alan Hartman, Leonid Raskin

Research output: Contribution to journal › Article › peer-review

Abstract

Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.

Original language	English
Pages (from-to)	149-156
Number of pages	8
Journal	Discrete Mathematics
Volume	284
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2003.11.029
State	Published - 6 Jul 2004
Externally published	Yes

Keywords

Covering array
Orthogonal array

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2003.11.029

Cite this

@article{94733e0bedc843de9082a6f374ac0160,

title = "Problems and algorithms for covering arrays",

abstract = "Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.",

keywords = "Covering array, Orthogonal array",

author = "Alan Hartman and Leonid Raskin",

year = "2004",

month = jul,

day = "6",

doi = "10.1016/j.disc.2003.11.029",

language = "English",

volume = "284",

pages = "149--156",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Problems and algorithms for covering arrays

AU - Hartman, Alan

AU - Raskin, Leonid

PY - 2004/7/6

Y1 - 2004/7/6

N2 - Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.

AB - Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.

KW - Covering array

KW - Orthogonal array

UR - http://www.scopus.com/inward/record.url?scp=2942689600&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2003.11.029

DO - 10.1016/j.disc.2003.11.029

M3 - Article

AN - SCOPUS:2942689600

SN - 0012-365X

VL - 284

SP - 149

EP - 156

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Problems and algorithms for covering arrays

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this