To meet the increasing demand for customized software, highly configurable systems
become essential in practice. Such systems offer many options to configure, and ensuring …

Combinatorial interaction testing (CIT) is a testing technique that has proven to be effective
in finding faults due to the interaction among inputs and in reducing the number of test …

Selecting an appropriate penalty coefficient is imperative when using penalty functions to
address constrained optimization problems. This paper introduces a novel approach, named …

Abstract Context: The Incremental Covering Array (ICA) offers a flexible and efficient test
schedule for Combinatorial Testing (CT) by enabling dynamic adjustment of test strength …

The research focus in the field of combinatorial testing has shifted from unconstrained
covering array generation (CAG) to constrained covering array generation (CCAG). Most …

Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus
on the efficient construction of Covering Arrays with Constraints of high strength. SAT solving …

Providing a reusable methodology for the evaluation of covering array generation utilities
and apply it to a corpus of such tools, obtaining an overview of supported features and …

Individual fairness testing (Ift) is a framework to find discriminatory instances within a given
classifier. In this paper, we show our idea of a Ift framework, that integrates the notion of data …

Since Combinatorial Testing (CT) was first proposed in 1980s, there have been more than
50 algorithms or tools published for Covering Array Generation (CAG). This paper …

To avoid the potential loss of identifying an incorrect testing strength, CT employs the object
of Incremental Covering Array (ICA) to offer a flexible test schedule that starts with a low …