Algorithmic methods for covering arrays of higher index

DOI10.1007/s10878-022-00947-xOpenAlexW4311878448MaRDI QIDQ2103319

Yanyan Li

Publication date: 13 December 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00947-x

zbMATH Keywords

conditional expectationsoftware testingcovering arrayin-parameter-order algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• AETG
• CAgen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering arrays from cyclotomy
• On existence and number of orthogonal arrays
• On a combinatorial framework for fault characterization
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• The Lovász local lemma and its applications to some combinatorial arrays
• An efficient design and implementation of the in-parameter-order algorithm
• In-parameter-order strategies for covering perfect hash families
• Perfect hash families: the generalization to higher indices
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• Locating and detecting arrays for interaction faults
• A survey of combinatorial testing
• Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
• Sharp bounds for the Lambert W function
• Balanced Families of Perfect Hash Functions and Their Applications
• Covering arrays of higher strength from permutation vectors

This page was built for publication: Algorithmic methods for covering arrays of higher index