The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penggunaan tatasusunan pengesanan didorong oleh penggunaan set ujian perisian menjana untuk mengesan kerosakan interaksi dalam sistem berasaskan komponen. Dalam kertas kerja ini, kami memperkenalkan konfigurasi gabungan baharu, yang dengannya penerangan gabungan umum tatasusunan $( ar{1},t)$-locating dibentangkan. Berdasarkan pencirian ini, beberapa tatasusunan pengesanan melalui SSOA dan tatasusunan meliputi perbezaan dengan sifat yang ditetapkan dibina dengan berkesan. Akibatnya, sempadan atas pada saiz tatasusunan pengesanan dengan bilangan faktor yang kecil kemudiannya diperolehi.
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
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Ce SHI, Jianfeng FU, Chengmin WANG, Jie YAN, "Upper Bounds and Constructions of Locating Arrays" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 5, pp. 827-833, May 2021, doi: 10.1587/transfun.2020EAL2081.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2081/_p
Salinan
@ARTICLE{e104-a_5_827,
author={Ce SHI, Jianfeng FU, Chengmin WANG, Jie YAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Upper Bounds and Constructions of Locating Arrays},
year={2021},
volume={E104-A},
number={5},
pages={827-833},
abstract={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.},
keywords={},
doi={10.1587/transfun.2020EAL2081},
ISSN={1745-1337},
month={May},}
Salinan
TY - JOUR
TI - Upper Bounds and Constructions of Locating Arrays
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 827
EP - 833
AU - Ce SHI
AU - Jianfeng FU
AU - Chengmin WANG
AU - Jie YAN
PY - 2021
DO - 10.1587/transfun.2020EAL2081
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2021
AB - 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.
ER -