Augmenting simulated annealing to build interaction test suites

M. B. Cohen, Charles Colbourn, A. C H Ling

Research output: Chapter in Book/Report/Conference proceedingConference contribution

86 Citations (Scopus)

Abstract

Component based software development is prone to unexpected interaction faults. The goal is to test as many-potential interactions as is feasible within time and budget constraints. Two combinatorial objects, the orthogonal array and the covering array, can be used to generate test suites that provide a guarantee for coverage of all t-sets of component interactions in the case when the testing of all interactions is not possible. Methods for construction of these types of test suites have focused on two main areas. The first is finding new algebraic constructions that produce smaller test suites. The second is refining computational search algorithms to find smaller test suites more quickly. In this paper we explore one method for constructing covering arrays of strength three that combines algebraic constructions with computational search. This method leverages the computational efficiency and optimality of size obtained through algebraic constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide some new bounds for some strength three covering arrays.

Original languageEnglish (US)
Title of host publicationProceedings - International Symposium on Software Reliability Engineering, ISSRE
PublisherIEEE Computer Society
Pages394-405
Number of pages12
Volume2003-January
ISBN (Print)0769520073
DOIs
StatePublished - 2003
Event14th International Symposium on Software Reliability Engineering, ISSRE 2003 - Denver, United States
Duration: Nov 17 2003Nov 20 2003

Other

Other14th International Symposium on Software Reliability Engineering, ISSRE 2003
CountryUnited States
CityDenver
Period11/17/0311/20/03

Fingerprint

Simulated annealing
Computational efficiency
Refining
Software engineering
Testing

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Cohen, M. B., Colbourn, C., & Ling, A. C. H. (2003). Augmenting simulated annealing to build interaction test suites. In Proceedings - International Symposium on Software Reliability Engineering, ISSRE (Vol. 2003-January, pp. 394-405). [1251061] IEEE Computer Society. https://doi.org/10.1109/ISSRE.2003.1251061

Augmenting simulated annealing to build interaction test suites. / Cohen, M. B.; Colbourn, Charles; Ling, A. C H.

Proceedings - International Symposium on Software Reliability Engineering, ISSRE. Vol. 2003-January IEEE Computer Society, 2003. p. 394-405 1251061.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cohen, MB, Colbourn, C & Ling, ACH 2003, Augmenting simulated annealing to build interaction test suites. in Proceedings - International Symposium on Software Reliability Engineering, ISSRE. vol. 2003-January, 1251061, IEEE Computer Society, pp. 394-405, 14th International Symposium on Software Reliability Engineering, ISSRE 2003, Denver, United States, 11/17/03. https://doi.org/10.1109/ISSRE.2003.1251061
Cohen MB, Colbourn C, Ling ACH. Augmenting simulated annealing to build interaction test suites. In Proceedings - International Symposium on Software Reliability Engineering, ISSRE. Vol. 2003-January. IEEE Computer Society. 2003. p. 394-405. 1251061 https://doi.org/10.1109/ISSRE.2003.1251061
Cohen, M. B. ; Colbourn, Charles ; Ling, A. C H. / Augmenting simulated annealing to build interaction test suites. Proceedings - International Symposium on Software Reliability Engineering, ISSRE. Vol. 2003-January IEEE Computer Society, 2003. pp. 394-405
@inproceedings{eccb66158c04408fb13ce10ea7448660,
title = "Augmenting simulated annealing to build interaction test suites",
abstract = "Component based software development is prone to unexpected interaction faults. The goal is to test as many-potential interactions as is feasible within time and budget constraints. Two combinatorial objects, the orthogonal array and the covering array, can be used to generate test suites that provide a guarantee for coverage of all t-sets of component interactions in the case when the testing of all interactions is not possible. Methods for construction of these types of test suites have focused on two main areas. The first is finding new algebraic constructions that produce smaller test suites. The second is refining computational search algorithms to find smaller test suites more quickly. In this paper we explore one method for constructing covering arrays of strength three that combines algebraic constructions with computational search. This method leverages the computational efficiency and optimality of size obtained through algebraic constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide some new bounds for some strength three covering arrays.",
author = "Cohen, {M. B.} and Charles Colbourn and Ling, {A. C H}",
year = "2003",
doi = "10.1109/ISSRE.2003.1251061",
language = "English (US)",
isbn = "0769520073",
volume = "2003-January",
pages = "394--405",
booktitle = "Proceedings - International Symposium on Software Reliability Engineering, ISSRE",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Augmenting simulated annealing to build interaction test suites

AU - Cohen, M. B.

AU - Colbourn, Charles

AU - Ling, A. C H

PY - 2003

Y1 - 2003

N2 - Component based software development is prone to unexpected interaction faults. The goal is to test as many-potential interactions as is feasible within time and budget constraints. Two combinatorial objects, the orthogonal array and the covering array, can be used to generate test suites that provide a guarantee for coverage of all t-sets of component interactions in the case when the testing of all interactions is not possible. Methods for construction of these types of test suites have focused on two main areas. The first is finding new algebraic constructions that produce smaller test suites. The second is refining computational search algorithms to find smaller test suites more quickly. In this paper we explore one method for constructing covering arrays of strength three that combines algebraic constructions with computational search. This method leverages the computational efficiency and optimality of size obtained through algebraic constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide some new bounds for some strength three covering arrays.

AB - Component based software development is prone to unexpected interaction faults. The goal is to test as many-potential interactions as is feasible within time and budget constraints. Two combinatorial objects, the orthogonal array and the covering array, can be used to generate test suites that provide a guarantee for coverage of all t-sets of component interactions in the case when the testing of all interactions is not possible. Methods for construction of these types of test suites have focused on two main areas. The first is finding new algebraic constructions that produce smaller test suites. The second is refining computational search algorithms to find smaller test suites more quickly. In this paper we explore one method for constructing covering arrays of strength three that combines algebraic constructions with computational search. This method leverages the computational efficiency and optimality of size obtained through algebraic constructions while benefiting from the generality of a heuristic search. We present a few examples of specific constructions and provide some new bounds for some strength three covering arrays.

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

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

U2 - 10.1109/ISSRE.2003.1251061

DO - 10.1109/ISSRE.2003.1251061

M3 - Conference contribution

AN - SCOPUS:27544459445

SN - 0769520073

VL - 2003-January

SP - 394

EP - 405

BT - Proceedings - International Symposium on Software Reliability Engineering, ISSRE

PB - IEEE Computer Society

ER -