Benchmarks for ApproxCov and ApproxMaxCov algorithms evaluation

This deposit contains the benchmarks used for the evaluation of ApproxCov and ApproxMaxCov algorithms and their extensions. Implementations of the algorithms can be found at https://github.com/meelgroup/approxcov.
The folder two_values/cnf contains constraints of configurable systems. It is a subset of benchmarks from https://zenodo.org/record/4022395 and https://zenodo.org/record/3793090. In this set of benchmarks all features can have two values.
The folder two_values/samples contains sets of configurations computed with baital, quicksampler, and waps tools.
The folder mult_values contains samples and constraints of configurable systems where features can have finite number of values. These benchmarks are taken from the evaluation materials of the paper [1] and are converted to the input format of ApproxCov and ApproxMaxCov algorithms.

[1] Brady J Garvin, Myra B Cohen, and Matthew B Dwyer. 2009. An improved meta-heuristic search for constrained interaction testing. In 2009 1st International Symposium on Search Based Software Engineering. IEEE, 13–22.