Constrained locating arrays for combinatorial interaction testing

12/06/2017
by   Hao Jin, et al.
0

This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in a testing process for information systems. CLAs extend ordinary locating arrays to make them applicable to testing of systems that have constraints on test parameters. Such constraints are common in real-world systems; thus CLA enhances the applicability of locating arrays to practical testing problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
08/07/2019

A Survey of Constrained Combinatorial Testing

Combinatorial Testing (CT) is a potentially powerful testing technique, ...
research
05/26/2021

Incomplete MaxSAT Approaches for Combinatorial Testing

We present a Satisfiability (SAT)-based approach for building Mixed Cove...
research
10/22/2020

Position-Agnostic Multi-Microphone Speech Dereverberation

Neural networks (NNs) have been widely applied in speech processing task...
research
11/10/2016

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

We propose a major revision of the format XCSP 2.1, called XCSP3, to bui...
research
05/18/2023

Balancing Test Accuracy and Security in Computerized Adaptive Testing

Computerized adaptive testing (CAT) is a form of personalized testing th...
research
04/16/2019

Finding minimum locating arrays using a CSP solver

Combinatorial interaction testing is an efficient software testing strat...

Please sign up or login with your details

Forgot password? Click here to reset