PRBOT-its: Building High Strength Mixed Covering Arrays with ConstraintsΒΆ
PRBOT-its is a greedy SAT-based algorithm for building high strength Mixed Covering Arrays with Constraints (MCACS).
Contents:
Note
Accepted in CP2021. If you use PRBOT-its in one of your research projects, please cite us:
@InProceedings{ansotegui_et_al:LIPIcs.CP.2021.12,
author = {Ans\'{o}tegui, Carlos and Ojeda, Jes\'{u}s and Torres, Eduard},
title = {{Building High Strength Mixed Covering Arrays with Constraints}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15303},
URN = {urn:nbn:de:0030-drops-153036},
doi = {10.4230/LIPIcs.CP.2021.12},
annote = {Keywords: Combinatorial Testing, Covering Arrays, Maximum Satisfiability}
}
@article{DBLP:abs-2105-12552,
author = {Carlos Ans{\'{o}}tegui and
Felip Many{\`{a}} and
Jesus Ojeda and
Josep M. Salvia and
Eduard Torres},
title = {Incomplete MaxSAT Approaches for Combinatorial Testing},
journal = {arXiv},
volume = {abs/2105.12552},
year = {2021},
url = {https://arxiv.org/abs/2105.12552},
archivePrefix = {arXiv},
eprint = {2105.12552},
timestamp = {Tue, 01 Jun 2021 18:07:59 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12552.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}