Finding minimum locating arrays using a CSP solver

04/16/2019
by   Tatsuya Konishi, et al.
0

Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering t-wise interactions where t is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, (1, t)-locating arrays can not only execute all t-way interactions but also identify, if any, which of the interactions causes a failure. In spite of this useful property, there is only limited research either on how to generate locating arrays or on their minimum sizes. In this paper, we propose an approach to generating minimum locating arrays. In the approach, the problem of finding a locating array consisting of N tests is represented as a Constraint Satisfaction Problem (CSP) instance, which is in turn solved by a modern CSP solver. The results of using the proposed approach reveal many (1, t)-locating arrays that are smallest known so far. In addition, some of these arrays are proved to be minimum.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2019

Using simulated annealing for locating array construction

Context: Combinatorial interaction testing is known to be an efficient t...
research
12/19/2017

Column Generation for Interaction Coverage in Combinatorial Software Testing

This paper proposes a novel column generation framework for combinatoria...
research
12/06/2017

Constrained locating arrays for combinatorial interaction testing

This paper introduces the notion of Constrained Locating Arrays (CLAs), ...
research
10/13/2021

Constrained Detecting Arrays: Mathematical Structures for Fault Identification in Combinatorial Interaction Testing

Context: Detecting arrays are mathematical structures aimed at fault ide...
research
05/26/2021

Incomplete MaxSAT Approaches for Combinatorial Testing

We present a Satisfiability (SAT)-based approach for building Mixed Cove...
research
12/01/2013

A Combined Approach for Constraints over Finite Domains and Arrays

Arrays are ubiquitous in the context of software verification. However, ...
research
01/02/2018

Unions of Orthogonal Arrays and their aberrations via Hilbert bases

We generate all the Orthogonal Arrays (OAs) of a given size n and streng...

Please sign up or login with your details

Forgot password? Click here to reset