Location of Repository

Using computational search to generate 2-way covering array

By Changhai Nie, Baowen Xu and Hareton Leung

Abstract

Software and its running environments are becoming more and more complex, and there are more and more factors that can influence the behavior of the software. For a software under test SUT, suppose there are n factors which may affect its execution, each factor(parameter) ci has ai (1 ≤ i ≤ n)values, and the value set is denoted as Vi, we need a1 × a2 × · · · an test cases if we do exhaustive testing. When n and ai are large, test cost will increase quickly. From observation, we need not run all the test cases, as sometimes there is only a small number of parameters which can trigger failure. So we just need to design a test suite to cover all the combinations of some parameters. Covering array CA is a m ×n matrix, and each row represents a test case for SUT, with all the values in the ith column from Vi, the value set of parameter i. If for every τ parameters of SUT: ci1, ci2, · · · , ciτ, each value combination in Vi1 ×Vi2, · · ·,Viτ can be found in some row of CA, CA is called τ-way covering array. When τ is not fixed in CA, it is called variable strength covering array(VCA). When τ = 2, it is 2-way covering array. In this paper we focus on generating 2-way covering array. Much work has been done to generate covering array. Computational search methods, including Heuristic search techniques (Hill Climbing(HC)

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.189.851
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ssbse.org/2009/fa/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.