A density-based greedy algorithm for higher strength covering arrays

Authors:
Renée C. Bryce;Charles J. Colbourn
Affiliations:
Computer Science, University of Nevada at Las Vegas, Las Vegas, NV 89154-4019, U.S.A.;Computing and Informatics, Arizona State University, Tempe, AZ 85287-8809, U.S.A.
Venue:
Software Testing, Verification & Reliability
Year:
2009

Citing 0
Cited 16

Binary Covering Arrays and Existentially Closed Graphs

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Covering and radius-covering arrays: Constructions and classification

Discrete Applied Mathematics
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
A survey of combinatorial testing

ACM Computing Surveys (CSUR)
Bad pairs in software testing

TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
A strategy for automatic quality signing and verification processes for hardware and software testing

Advances in Software Engineering - Special issue on software test automation
Design and implementation of a t-way test data generation strategy with automated execution tool support

Information Sciences: an International Journal
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms

SIAM Journal on Discrete Mathematics
A variable strength interaction test suites generation strategy using Particle Swarm Optimization

Journal of Systems and Software
New bounds for binary covering arrays using simulated annealing

Information Sciences: an International Journal
Application of Particle Swarm Optimization to uniform and variable strength covering array construction

Applied Soft Computing
Efficient conditional expectation algorithms for constructing hash families

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Strengthening hash families and compressive sensing

Journal of Discrete Algorithms
Randomized post-optimization of covering arrays

European Journal of Combinatorics
Pairwise testing for software product lines: comparison of two approaches

Software Quality Control
Constraints dependent t-way test suite generation using harmony search strategy

PKAW'12 Proceedings of the 12th Pacific Rim conference on Knowledge Management and Acquisition for Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithmic construction of software interaction test suites has focussed on pairwise coverage; less is known about the efficient construction of test suites for t-way interactions with t≥3. This study extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites and shows that it guarantees a logarithmic upper bound on the size of the test suites as a function of the number of factors. To complement this theoretical guarantee, an implementation is outlined and some practical improvements are made. Computational comparisons with other published methods are reported. Many of the results improve upon those in the literature. However, limitations on the ability of one-test-at-a-time algorithms are also identified. Copyright © 2008 John Wiley & Sons, Ltd.