Efficient software testing protocols

Authors:
Brett Stevens;Eric Mendelsohn
Affiliations:
Department of Mathematics, University of Toronto, 100 St. George St. Toronto ON M5S 3G3;Department of Mathematics, University of Toronto, 100 St, George St. Toronto ON M5S 3G3
Venue:
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
Year:
1998

Citing 11
Cited 6

Design theory

Design theory
On the maximum number of qualitatively independent partitions

Journal of Combinatorial Theory Series A
A Sperner-type theorem and qualitative independence

Journal of Combinatorial Theory Series A
Qualitative independence and Sperner problems for directed graphs

Journal of Combinatorial Theory Series A
Capacities: from information theory to extremal set theory

Journal of Combinatorial Theory Series A
The construction of antipodal triple systems by simulated annealing

Discrete Mathematics - Special issue on combinatorics
The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
Lower Bounds for Transversal Covers

Designs, Codes and Cryptography
The Combinatorial Design Approach to Automatic Test Generation

IEEE Software
A practical strategy for testing pair-wise coverage of network interfaces

ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Constructing test suites for interaction testing

Proceedings of the 25th International Conference on Software Engineering
Covering arrays on graphs

Journal of Combinatorial Theory Series B
Automated incremental pairwise testing of software product lines

SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
Design and implementation of a t-way test data generation strategy with automated execution tool support

Information Sciences: an International Journal
Industrial evaluation of pairwise SPL testing with MoSo-PoLiTe

Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Model-based pairwise testing for feature interaction coverage in software product line engineering

Software Quality Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Testing software against failure rapidly, efficiently and comprehensively is of vital importance to software programmers and designers. Complete testing is far too slow and costly. Randomized testing can suffer from deficiencies of the pseudo-random number generator used. Testing all pairwise input interactions is a relatively new idea that resolves this problem. It is extraordinarily efficient; the number of test cases only grows as the log of the number of inputs. Recent evidence shows that the vast majority of all software failures are single or pairwise input interactions. A test protocol that covers all pairwise interactions of inputs is called a covering array. For applications, the central issue is to be able to produce small covering arrays with given parameters on demand. This paper presents a number of methods to generate efficient pairwise testing protocols. A software package using these methods to generate test protocols is also discussed.