The search functionality is under construction.
The search functionality is under construction.

Upper Bounds and Constructions of Locating Arrays

Ce SHI, Jianfeng FU, Chengmin WANG, Jie YAN

  • Full Text Views

    0

  • Cite this

Summary :

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 $(ar{1},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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E104-A No.5 pp.827-833
Publication Date
2021/05/01
Publicized
2020/11/13
Online ISSN
1745-1337
DOI
10.1587/transfun.2020EAL2081
Type of Manuscript
LETTER
Category
Reliability, Maintainability and Safety Analysis

Authors

Ce SHI
  Shanghai Lixin University of Accounting and Finance
Jianfeng FU
  Shanghai Lixin University of Accounting and Finance
Chengmin WANG
  Taizhou University
Jie YAN
  Jiangnan University

Keyword