Artifact for SamplingCA: Effective and Efficient Sampling-based Pairwise Testing for Highly Configurable Software Systems
SamplingCA is an effective and efficient sampling-based approach for pairwise testing of highly configurable software systems. This file serves as a brief description of our artifact, including our implementation of SamplingCA (henceforth referred to as SamplingCA), the testing instances adopted in the experiments and the experimental results.
Combinatorial interaction testing (CIT) is a popular testing methodology for testing interactions of options of highly configurable systems. In the context of CIT, covering arrays are the test suites that can cover all such interactions, possibly under certain constraints. Particularly, pairwise covering arrays (PCAs) are widely employed, since they can achieve a good balance between testing costs and fault detection capability.
SamplingCA is a state-of-the-art algorithm for generating small-sized PCAs efficiently. In our implementation of SamplingCA, the input is a system under test (SUT), modeled as a Boolean formula in CNF in Dimacs format. It outputs a PCA of the given SUT, where each line represents a valid configuration.
Software/Hardware requirements of SamplingCA are listed in REQUIREMENTS.md.
We present the instructions for obtaining, building and running SamplingCA in README.md and INSTALL.md.
We apply for the following badges: Available, Functional and Reusable. We present our reasons for applying them in STATUS.md.
SamplingCA uses the GPL-3.0 license. Check LICENSE.md for more information.