Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet?

Abstract : Uniform or near-uniform generation of solutions for large satisfiability formulas is a problem of theoretical and practical interest for the testing community. Recent works proposed two algorithms (namely UniGen and QuickSampler) for reaching a good compromise between execution time and uniformity guarantees, with empirical evidence on SAT benchmarks. In the context of highly-configurable software systems (e.g., Linux), it is unclear whether UniGen and QuickSampler can scale and sample uniform software configurations. In this paper, we perform a thorough experiment on 128 real-world feature models. We find that UniGen is unable to produce SAT solutions out of such feature models. Furthermore, we show that QuickSampler does not generate uniform samples and that some features are either never part of the sample or too frequently present. Finally, using a case study, we characterize the impacts of these results on the ability to find bugs in a configurable system. Overall, our results suggest that we are not there: more research is needed to explore the cost-effectiveness of uniform sampling when testing large configurable systems.
Liste complète des métadonnées

https://hal.inria.fr/hal-01991857
Contributor : Mathieu Acher <>
Submitted on : Thursday, January 24, 2019 - 10:18:58 AM
Last modification on : Thursday, February 7, 2019 - 2:21:43 PM

File

Uniform_Sampling_of_SAT_Soluti...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01991857, version 1

Citation

Quentin Plazar, Mathieu Acher, Gilles Perrouin, Xavier Devroey, Maxime Cordy. Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet?. ICST 2019 - 12th International Conference on Software Testing, Verification, and Validation, Apr 2019, Xian, China. pp.1-12. ⟨hal-01991857⟩

Share

Metrics

Record views

123

Files downloads

127