In this paper, we present an efficient approach for enumerating all valid t-tuples for a given configuration space model, which is an important task in computing covering arrays. The results of our experiments suggest that the proposed approach scales better than existing approaches
Although combinatorial testing has been widely studied and used, there are still some situations and...
Exhaustive testing of highly configurable software systems is generally infeasible as the number of ...
Combinatorial testing aims at covering the interactions of parameters in a system under test, while ...
In this paper, we present an efficient approach for enumerating all valid t-tuples for a gi...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
The configuration spaces of modern software systems are too large to test exhaustively. Combinatoria...
Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus on the eff...
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints...
A covering array CA(N;t, k, v) is an N×k array with entries in {1,2,...,v}, for which every N×t suba...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
Software testing is an essential part of software development that seeks quality assurance, reliabil...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Software systems generally have a large number of configurable options interacting with each other. ...
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discove...
Although combinatorial testing has been widely studied and used, there are still some situations and...
Exhaustive testing of highly configurable software systems is generally infeasible as the number of ...
Combinatorial testing aims at covering the interactions of parameters in a system under test, while ...
In this paper, we present an efficient approach for enumerating all valid t-tuples for a gi...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
The configuration spaces of modern software systems are too large to test exhaustively. Combinatoria...
Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus on the eff...
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints...
A covering array CA(N;t, k, v) is an N×k array with entries in {1,2,...,v}, for which every N×t suba...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
Software testing is an essential part of software development that seeks quality assurance, reliabil...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Software systems generally have a large number of configurable options interacting with each other. ...
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discove...
Although combinatorial testing has been widely studied and used, there are still some situations and...
Exhaustive testing of highly configurable software systems is generally infeasible as the number of ...
Combinatorial testing aims at covering the interactions of parameters in a system under test, while ...