Covering Array Constructors: An Experimental Analysis of Their Interaction Coverage and Fault Detection

Author:

Huang Rubing1,Chen Haibo2,Zhou Yunan2,Yueh Chen Tsong3,Towey Dave4,Fai Lau Man3,Ng Sebastian3,Merkel Robert5,Chen Jinfu2

Affiliation:

1. School of Computer Science and Communication Engineering, and Jiangsu Key Laboratory of Security Technology for Industrial Cyberspace, Jiangsu University, Zhenjiang, Jiangsu 212013, China

2. School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 202013, Jiangsu, China

3. Department of Computer Science and Software Engineering, Swinburne University of Technology, Hawthorn 3122, VIC, Australia

4. School of Computer Science, University of Nottingham Ningbo China, Ningbo 315100, Zhejiang, China

5. Faculty of Information Technology, Monash University, Clayton 3168, VIC, Australia

Abstract

Abstract Combinatorial interaction testing (CIT) aims at constructing a covering array (CA) of all value combinations at a specific interaction strength, to detect faults that are caused by the interaction of parameters. CIT has been widely used in different applications, with many algorithms and tools having been proposed to support CA construction. To date, however, there appears to have been no studies comparing different CA constructors when only some of the CA test cases are executed. In this paper, we present an investigation of five popular CA constructors: ACTS, Jenny, PICT, CASA and TCA. We conducted empirical studies examining the five programs, focusing on interaction coverage and fault detection. The experimental results show that when there is no preference or special justification for using other CA constructors, then Jenny is recommended—because it achieves better interaction coverage and fault detection than the other four constructors in many cases. Our results also show that when using ACTS or CASA, their CAs must be prioritized before testing. The main reason for this is that these CAs can result in considerable interaction coverage or fault detection capabilities when executing a large number of test cases; however, they may also produce the lowest rates of fault detection and interaction coverage.

Funder

National Natural Science Foundation of China

China Postdoctoral Science Foundation

Senior Personnel Scientific Research Foundation of Jiangsu University

Young Backbone Teacher Cultivation Project of Jiangsu University

Postgraduate Research & Practice Innovation Program of Jiangsu Province

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Reference65 articles.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. DYNAMIC PROBABILITY SELECTION FOR FLOWER POLLINATION ALGORITHM BASED ON METROPOLISHASTINGS CRITERIA;Journal of Information and Communication Technology;2020-11-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3