期刊
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
卷 E104A, 期 5, 页码 827-833出版社
IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS
DOI: 10.1587/transfun.2020EAL2081
关键词
locating arrays; upper bound; extendible; covering arrays; construction
类别
资金
- Natural Science Foundation of Shanghai [17ZR1419900]
- Xulun Scholar Plan of Shanghai Lixin University of Accounting and Finance
- Ministry of Education in China Project of Humanities and Social Sciences for Youth Scholars [19YJCZH031]
- NSFC [11471144]
- Natural Science Foundation of Jiangsu [BK20171318]
- Qing Lan Project of Jiangsu and Overseas Study Program of Jiangsu University
This paper introduces a new combinatorial configuration for describing locating arrays, effectively constructs locating arrays with prescribed properties, and obtains upper bounds on the size of locating arrays with small number of factors.
The use of locating arrays is motivated by the use of generating software test suites to locate interaction faults in component-based systems. In this paper, we introduce a new combinatorial configuration, with which a general combinatorial description of ((1) over bar, t)-locating arrays is presented. Based on this characterization, a number of locating arrays by means of SSOA and difference covering arrays with prescribed properties are constructed effectively. As a consequence, upper bounds on the size of locating arrays with small number of factors are then obtained.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
