License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2021.12
URN: urn:nbn:de:0030-drops-153036
URL: https://drops.dagstuhl.de/opus/volltexte/2021/15303/
Go to the corresponding LIPIcs Volume Portal


Ansótegui, Carlos ; Ojeda, Jesús ; Torres, Eduard

Building High Strength Mixed Covering Arrays with Constraints

pdf-format:
LIPIcs-CP-2021-12.pdf (0.8 MB)


Abstract

Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus on the efficient construction of Covering Arrays with Constraints of high strength. SAT solving technology has been proven to be well suited when solving Covering Arrays with Constraints. However, the size of the SAT reformulations rapidly grows up with higher strengths. To this end, we present a new incomplete algorithm that mitigates substantially memory blow-ups. The experimental results confirm the goodness of the approach, opening avenues for new practical applications.

BibTeX - Entry

@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}
}

Keywords: Combinatorial Testing, Covering Arrays, Maximum Satisfiability
Collection: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Issue Date: 2021
Date of publication: 15.10.2021
Supplementary Material: The tools we implemented are available in http://hardlog.udl.cat/static/doc/prbot-its/html/index.html as well as detailed installation and execution instructions.


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI