Using binary decision diagrams for constraint handling in combinatorial interaction testing

07/03/2019
by   Tatsuhiro Tsuchiya, et al.
0

Constraints among test parameters often have substantial effects on the performance of test case generation for combinatorial interaction testing. This paper investigates the effectiveness of the use of Binary Decision Diagrams (BDDs) for constraint handling. BDDs are a data structure used to represent and manipulate Boolean functions. The core role of a constraint handler is to perform a check to determine if a partial test case with unspecified parameter values satisfies the constraints. In the course of generating a test suite, this check is executed a number of times; thus the efficiency of the check significantly affects the overall time required for test case generation. In the paper, we study two different approaches. The first approach performs this check by computing the logical AND of Boolean functions that represent all constraint-satisfying full test cases and a given partial test case. The second approach uses a new technique to construct a BDD that represents all constraint-satisfying partial test cases. With this BDD, the check can be performed by simply traversing the BDD from the root to a sink. We developed a program that incorporates both approaches into IPOG, a well-known test case generation algorithm. Using this program, we empirically evaluate the performance of these BDD-based constraint handling approaches using a total of 62 problem instances. In the evaluation, the two approaches are compared with three different constraint handling approaches, namely, those based on Boolean satisfiability (SAT) solving, Minimum Forbidden Tuples (MFTs), and Constraint Satisfiction Problem (CSP) solving. The results of the evaluation show that the two BDD-based approaches usually outperform the other constraint handling techniques and that the BDD-based approach using the new technique exhibits best performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2022

Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types

In program verification, constraint-based random testing is a powerful t...
research
02/04/2014

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

We present an approach to propagation-based SAT encoding of combinatoria...
research
10/15/2021

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints

When solving a combinatorial problem using propositional satisfiability ...
research
06/10/2020

At-Most-One Constraints in Efficient Representations of Mutex Networks

The At-Most-One (AMO) constraint is a special case of cardinality constr...
research
02/01/2019

Practical Model-driven Data Generation for System Testing

The ability to generate test data is often a necessary prerequisite for ...
research
08/23/2018

Enhancing POI testing approach through the use of additional information

Recently, a new approach to perform regression testing has been defined:...
research
12/19/2017

Column Generation for Interaction Coverage in Combinatorial Software Testing

This paper proposes a novel column generation framework for combinatoria...

Please sign up or login with your details

Forgot password? Click here to reset