Expected time to detection of interaction faults

MaRDI QIDQ2866562zbMATH OpenFDO

Authors Renée C. Bryce, Charles J. Colbourn

Publication date 13 December 2013

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Locating and detecting arrays for interaction faults
• Optimum detecting arrays for independent interaction faults
• Faulty interaction identification via constraint solving and optimization
• On a combinatorial framework for fault characterization
• Locating one pairwise interaction: three recursive constructions

Cited in

(3)

• On a combinatorial framework for fault characterization
• Faulty interaction identification via constraint solving and optimization
• Applying higher strength combinatorial criteria to test case prioritization: a case study

This page was built for publication: Expected time to detection of interaction faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866562)