A survey of methods for constructing covering arrays

Kuliamin, Victor V.; Petukhov, Alexander

doi:10.1134/s0361768811030029

Cited by 37 publications

(20 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For simplicity, assume that only interaction (c, d, f ) is faulty, and only interaction (c, d, e) is infeasible, and all other interactions pass the testing. If one assigns configurations 1, 3,5,7,9,11,13,15 into Server 1 , configurations 2, 4, 6, 8, 10, 12, 14 into Server 2 , and 4-11 configurations into Server 3 .…”

Section: Merging Concurrent Testing Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Test algebra for combinatorial testing

Tsai¹,

Colbourn²,

Luo³

et al. 2013

2013 8th International Workshop on Automation of Software Test (AST)

View full text Add to dashboard Cite

This paper proposes a new algebraic system, Test Algebra (T A), for identifying faults in combinatorial testing for SaaS (Software-as-a-Service) applications. SaaS as a part of cloud computing is a new software delivery model, and mission-critical applications are composed, deployed, and executed in cloud platforms. Testing SaaS applications is a challenging task because new applications need to be tested when they are composed before they can be deployed for execution. Combinatorial testing algorithms can be used to identify faulty configurations and interactions from 2-way all the way to k-way where k is the number of components in the application. The T A defines rules to identify faulty configurations and interactions. Using the rules defined in the T A, a collection of configurations can be tested concurrently in different servers and in any order and the results obtained will be still same due to the algebraic constraints.

show abstract

Section: Merging Concurrent Testing Resultsmentioning

confidence: 99%

“…Covering arrays reveal faults that arise from improper interaction of t or fewer elements [9]. There are numerous computational and mathematical approaches for construction of covering arrays with a number of tests as small as possible [3], [7].…”

Section: Related Workmentioning

confidence: 99%

Test algebra for combinatorial testing

Tsai¹,

Colbourn²,

Luo³

et al. 2013

2013 8th International Workshop on Automation of Software Test (AST)

View full text Add to dashboard Cite

show abstract

“…Covering arrays reveal faults that arise from improper interaction of t or fewer elements [10]. There are numerous computational and mathematical approaches for construction of covering arrays with few tests [4], [8].…”

Section: B Traditional Combinatorial Testingmentioning

confidence: 99%

Test-Algebra Execution in a Cloud Environment

Tsai

Jin

et al. 2014

2014 IEEE 8th International Symposium on Service Oriented System Engineering

View full text Add to dashboard Cite

A algebraic system, Test Algebra (TA), identifies faults in combinatorial testing for SaaS (Software-as-a-Service) applications. SaaS is a software delivery model that involves composition, deployment, and execution of mission application on cloud platforms. Testing SaaS applications is challenging because a large number of configurations needs to be tested. Faulty configurations should be identified and corrected before the delivery of SaaS applications. TA proposes an effective way to reuse existing test results to identify test results of candidate configurations. The TA also defines rules to permit results to be combined, and to identify the faulty interactions. Using the TA, configurations can be tested concurrently on different servers and in any order. This paper proposes one MapReduce design of TA concurrent execution in a cloud environment. The optimization of TA analysis is discussed. The proposed solutions are simulated using Hadoop in a cloud environment.

show abstract

“…The basic goal of such techniques is to cover every t − tuple of any input interaction of system under test at least once [1]. Two survey papers have been written on the topic of combinatorial testing strategies [20, 21] while Kuliamin and Petukhov [22] present a survey on the methods of constructing CAs. The methods for constructing CAs can be categorized into three categories [1, 19]: (1) algebraic methods (2) meta-heuristic methods and (3) greedy search methods.…”

Section: Introductionmentioning

confidence: 99%

Optimum Design of PIλDμ Controller for an Automatic Voltage Regulator System Using Combinatorial Test Design

et al. 2016

View full text Add to dashboard Cite

Combinatorial test design is a plan of test that aims to reduce the amount of test cases systematically by choosing a subset of the test cases based on the combination of input variables. The subset covers all possible combinations of a given strength and hence tries to match the effectiveness of the exhaustive set. This mechanism of reduction has been used successfully in software testing research with t-way testing (where t indicates the interaction strength of combinations). Potentially, other systems may exhibit many similarities with this approach. Hence, it could form an emerging application in different areas of research due to its usefulness. To this end, more recently it has been applied in a few research areas successfully. In this paper, we explore the applicability of combinatorial test design technique for Fractional Order (FO), Proportional-Integral-Derivative (PID) parameter design controller, named as FOPID, for an automatic voltage regulator (AVR) system. Throughout the paper, we justify this new application theoretically and practically through simulations. In addition, we report on first experiments indicating its practical use in this field. We design different algorithms and adapted other strategies to cover all the combinations with an optimum and effective test set. Our findings indicate that combinatorial test design can find the combinations that lead to optimum design. Besides this, we also found that by increasing the strength of combination, we can approach to the optimum design in a way that with only 4-way combinatorial set, we can get the effectiveness of an exhaustive test set. This significantly reduced the number of tests needed and thus leads to an approach that optimizes design of parameters quickly.

show abstract

A survey of methods for constructing covering arrays

Cited by 37 publications

References 34 publications

Test algebra for combinatorial testing

Test algebra for combinatorial testing

Test-Algebra Execution in a Cloud Environment

Optimum Design of PIλDμ Controller for an Automatic Voltage Regulator System Using Combinatorial Test Design

Contact Info

Product

Resources

About