Search-based Diverse Sampling from Real-world Software Product Lines
Yi Xiang, Han Huang, Yuren Zhou, Sizhe Li, Chuan Luo, Qingwei Lin, Miqing Li, Xiaowei Yang
Abstract
Real-world software product lines (SPLs) often encompass enormous valid configurations that are impossible to enumerate. To understand properties of the space formed by all valid configurations, a feasible way is to select a small and valid sample set. Even though a number of sampling strategies have been proposed, they either fail to produce diverse samples with respect to the number of selected features (an important property to characterize behaviors of configurations), or achieve diverse sampling but with limited scalability (the handleable configuration space size is limited to 1013). To resolve this dilemma, we propose a scalable diverse sampling strategy, which uses a distance metric in combination with the novelty search algorithm to produce diverse samples in an incremental way. The distance metric is carefully designed to measure similarities between configurations, and further diversity of a sample set. The novelty search incrementally improves diversity of samples through the search for novel configurations. We evaluate our sampling algorithm on 39 real-world SPLs. It is able to generate the required number of samples for all the SPLs, including those which cannot be counted by sharpSAT, a state-of-the-art model counting solver. Moreover, it performs better than or at least competitively to state-of-the-art samplers regarding diversity of the sample set. Experimental results suggest that only the proposed sampler (among all the tested ones) achieves scalable diverse sampling.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- LLM4Perf: Large Language Models Are Effective Samplers for Multi-Objective Performance ModelingXin Wang, Zhenhao Li, Zishuo DingICSE 2026
- Evaluating Risk and Confidence in Performance Bounds of Configuration Sampling StrategiesKallistos Weis, Martina Maggio, Norbert Siegmund, Sven ApelFSE 2026
- Variability-Aware FuzzingMeah Tahmeed Ahmed, Arnab Dev, Shiyi WeiICSE 2026
Builds on1
Related papers
- Can SAT Solvers Keep Up With the Linux Kernel's Feature Model?Elias Kuiter, Urs-Benedict Braun, Thomas Thüm, Sebastian Krieter et al.ICSE 2026
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT ProblemJiaxin Liang, Junping Zhou, Minghao YinAAAI 2025 · 1 citation
- Scalable Sampling of Highly-Configurable Systems: Generating Random Instances of the Linux KernelDavid Fernández-Amorós, Ruben Heradio, Christoph Mayr-Dorn, Alexander EgyedASE 2022 · 1 citation
- Integrating Multiple Features for Weakly-Supervised False-Passing Products Detection in Software Product LinesTao Zhang, Yan Lei, Haoran Xia, Huan Xie et al.ISSTA 2026
- LS-sampling: an effective local search based sampling approach for achieving high t-wise coverageChuan Luo, Binqi Sun, Bo Qiao, Junjie Chen et al.FSE 2021 · 24 citations
