Webcalled a t-way covering array (CA), where t is the covering strength. A major drawback of existing solvers for CA generation is that they usually need considerable time to obtain a high-quality solution, which hinders its wider applications. In this paper, we describe FastCA, an effective and efficient tool for generating constrained CAs. WebAbstract: Covering array generation is a key issue in combinatorial testing. A number of researchers have been applying greedy algorithms for covering array construction. A greedy framework has been built to integrate most greedy algorithms and evaluate new approaches derived from this framework.

Effective Discrete Memetic Algorithms for Covering Array …

Webrequired covering strength. This process is of high complexity and is very time-consuming in practice. For instance, considering the Apache HTTP Server instance with k= 172 … WebDec 9, 2013 · Covering arrays are sometimes also called t-surjective arrays or qualitatively t-independent families; when t=2 covering arrays are also called group covering designs or transversal covers. toys r us advert

SamplingCA: effective and efficient sampling-based pairwise …

WebMar 1, 2024 · Constrained Covering Array Generation (CCAG) is of fundamental importance for the application of CT, and has attracted extensive attentions in the … WebFastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation. In Proceedings of ICSE 2024 (Companion Volume). 77–80. Google Scholar Digital Library; Jinkun Lin, Shaowei Cai, Chuan Luo, Qingwei Lin, and Hongyu Zhang. 2024. Towards More Efficient Meta-heuristic Algorithms for Combinatorial Test Generation. WebOct 23, 2013 · A Max-SAT-Based Approach to Constructing Optimal Covering Arrays Semantic Scholar DOI: 10.3233/978-1-61499-320-9-51 Corpus ID: 41188967 A Max-SAT-Based Approach to Constructing Optimal Covering Arrays C. Ansótegui, Idelfonso Izquierdo, +1 author J. Torres-Jiménez Published in International Conference of… 23 … toys r us affiliate program