Standard

Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet? / Plazar, Quentin; Acher, Mathieu; Perrouin, Gilles; Devroey, Xavier; Cordy, Maxime.

Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification. Xi'an, China : IEEE, 2019. (ICST '19).

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Harvard

Plazar, Q, Acher, M, Perrouin, G, Devroey, X & Cordy, M 2019, Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet? in Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification. ICST '19, IEEE, Xi'an, China.

APA

Plazar, Q., Acher, M., Perrouin, G., Devroey, X., & Cordy, M. (2019). Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet? In Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification (ICST '19). Xi'an, China: IEEE.

Vancouver

Plazar Q, Acher M, Perrouin G, Devroey X, Cordy M. Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet? In Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification. Xi'an, China: IEEE. 2019. (ICST '19).

Author

Plazar, Quentin ; Acher, Mathieu ; Perrouin, Gilles ; Devroey, Xavier ; Cordy, Maxime. / Uniform Sampling of SAT Solutions for Configurable Systems: Are We There Yet?. Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification. Xi'an, China : IEEE, 2019. (ICST '19).

BibTeX

@inproceedings{f568f3328fa84b798b90304b063bfb94,
title = "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.",
author = "Quentin Plazar and Mathieu Acher and Gilles Perrouin and Xavier Devroey and Maxime Cordy",
year = "2019",
month = "4",
day = "22",
language = "English",
series = "ICST '19",
publisher = "IEEE",
booktitle = "Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification",

}

RIS

TY - GEN

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

AU - Plazar, Quentin

AU - Acher, Mathieu

AU - Perrouin, Gilles

AU - Devroey, Xavier

AU - Cordy, Maxime

PY - 2019/4/22

Y1 - 2019/4/22

N2 - 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.

AB - 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.

M3 - Conference contribution

T3 - ICST '19

BT - Proceedings of the 12th IEEE Conference on Software Testing, Validation and Verification

PB - IEEE

CY - Xi'an, China

ER -

ID: 50255280