Incomplete MaxSAT approaches for combinatorial testing
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum...
| Autores: | , , , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2022 |
| País: | España |
| Recursos: | Universitat de Lleida (UdL) |
| Repositório: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/84116 |
| Acesso em linha: | https://doi.org/10.1007/s10732-022-09495-3 http://hdl.handle.net/10459.1/84116 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Combinatorial testing Maximum satisfiability Constraint programming |
| Resumo: | We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum Satisfiability (MaxSAT) technology by describing efficient encodings for different classes of complete and incomplete MaxSAT solvers to compute optimal and suboptimal solutions, respectively. Similarly, we show how to solve through MaxSAT technology a closely related problem, the Tuple Number problem, which we extend to incorporate constraints. For this problem, we additionally provide a new MaxSAT-based incomplete algorithm. The extensive experimental evaluation we carry out on the available Mixed Covering Arrays with Constraints benchmarks and the comparison with state-of-the-art tools confirm the good performance of our approaches. |
|---|