检索结果-内蒙古大学图书馆

2nd International Conference on Networked Digital Technologies

作者： Klaib, Mohammad F. J. Muthuraman, Sangeetha Ahmad, Noraziah Sidek, Roslina Univ Malaysia Pahang Fac Comp Syst & Software Eng Kuantan Malaysia

ISBN: (纸本)9783642143052

Software testing is a very important phase of the software development cycle which ensures that the system developed is reliable and acceptable. Optimizing the test suite size of software eliminates the unnecessary cost and resources that are involved in testing. Sometimes it is not possible to exhaustively test any system due to huge number of test cases. In order to test any system and make it acceptable, combinatorial software interaction testing has been used in several fields. Investigations have concluded that most of the software faults could be identified by pairwise combinatorial interaction testing. Researchers have applied parallel algorithms to various combinatorial optimisation problems and have succeeded in significant time reduction in solving the problems. Large and/or computationally expensive optimization problems sometimes require parallel or high-performance computing systems to achieve reasonable running times. In this paper we propose a new strategy, "A Parallel Tree Based Strategy for Pairwise combinatorial interaction testing". The proposed strategy is based on two algorithms, a parallel tree generation algorithm and a parallel cost calculation algorithm, which are used in constructing a test suite with minimum number of test cases. The correctness of the strategy has been proved, and imperial results show that our strategy is efficient in test size reduction.

关键词： parallel algorithms combinatorial interaction testing software testing

来源：评论

学校读者我要写书评

暂无评论

Summary of Constrained Detecting Arrays: Mathematical Structures for Fault Identification in combinatorial interaction testing

Summary of Constrained Detecting Arrays: Mathematical Struct...

引用

17th IEEE International Conference on Software testing, Verification, and Validation (ICST)

作者： Jin, Hao Shi, Ce Tsuchiya, Tatsuhiro Osaka Univ Osaka Japan Shanghai Lixin Univ Accounting & Finance Shanghai Peoples R China

ISBN: (纸本)9798350344806;9798350344790

Detecting arrays are mathematical objects designed for identifying faulty interactions in combinatorial interaction testing. Our paper introduces constrained detecting arrays (CDAs), an extension of the detecting arrays. In contrast to detecting arrays, CDAs allow for constraints on parameters. We explored the mathematical properties of CDAs and presented two algorithms for constructing them: one for generating minimum CDAs and another for quicker generation of CDAs. The experimental results demonstrated that the two algorithms offer different advantages in terms of array size and generation time.

关键词： combinatorial interaction testing detecting arrays constraint handling fault identification

来源：评论

学校读者我要写书评

暂无评论

A Parallel Tree Based Strategy for T-Way combinatorial interaction testing

A Parallel Tree Based Strategy for T-Way Combinatorial Inter...

引用

2nd International Conference on Software Engineering and Computing Systems (ICSECS 2011)

作者： Klaib, Mohammad F. J. Muthuraman, Sangeetha Noraziah, A. Jadara Univ Fac Sci & Informat Technol Dept Software Engn Irbid Jordan Univ Malaysia Pahang Facu Comp Syst & Software Engn Pahang Malaysia

ISBN: (纸本)9783642222023

All software systems are built with basic components which interact with each other through predefined combination rules. As the number of components increases, the interactions between the components also increases exponentially which cause the combinatorial explosion problem. This mean complete (exhaustive) testing becomes unreasonable due to the huge number of possible combinations. Although 2-way interaction testing (i.e. pairwise testing) can relief and detect 50-97 percent of errors, empirical evidence has proved that 2-way interaction testing is a poor strategy for testing highly interactive systems and it has been showed that most of the errors are triggered by the interaction of 2-6 input parameters. In this paper we enhanced our previous strategy, "A Tree Based Strategy for Test Data Generation and Cost Calculation" by applying parallel algorithms to go beyond pairwise testing. The proposed strategy can support higher interaction testing. The designed algorithms are described in details with efficient empirical results.

关键词： parallel algorithms combinatorial interaction testing software testing T-way testing

来源：评论

学校读者我要写书评

暂无评论

Systematic Training and testing for Machine Learning Using combinatorial interaction testing 14

Systematic Training and Testing for Machine Learning Using C...

引用

15th IEEE International Conference on Software testing, Verification and Validation (ICST)

作者： Cody, Tyler Lanus, Erin Doyle, Daniel D. Freeman, Laura Virginia Tech Natl Secur Inst Arlington VA 22201 USA Mitre Corp Mclean VA USA

ISBN: (纸本)9781665496285

This paper demonstrates the systematic use of combinatorial coverage for selecting and characterizing test and training sets for machine learning models. The presented work adapts combinatorial interaction testing, which has been successfully leveraged in identifying faults in software testing, to characterize data used in machine learning. The MNIST handwritten digits data is used to demonstrate that combinatorial coverage can be used to select test sets that stress machine learning model performance, to select training sets that lead to robust model performance, and to select data for fine-tuning models to new domains. Thus, the results posit combinatorial coverage as a holistic approach to training and testing for machine learning. In contrast to prior work which has focused on the use of coverage in regard to the internal of neural networks, this paper considers coverage over simple features derived from inputs and outputs. Thus, this paper addresses the case where the supplier of test and training sets for machine learning models does not have intellectual property rights to the models themselves. Finally, the paper addresses prior criticism of combinatorial coverage and provides a rebuttal which advocates the use of coverage metrics in machine learning applications.

关键词： combinatorial interaction testing machine learning black-box testing test set construction training set construction data labeling

来源：评论

学校读者我要写书评

暂无评论

Generating High Strength Test Suites for combinatorial interaction testing Using ZDD-Based Graph Algorithms 22

Generating High Strength Test Suites for Combinatorial Inter...

引用

IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Ohashi, Teru Tsuchiya, Tatsuhiro Osaka Univ 1-5 Yamadaoka Suita Osaka 5650871 Japan

ISBN: (纸本)9781509056521

combinatorial interaction testing is a well practiced method for detecting faults for various computing systems. This method requires that any t-wise parameter interactions must be exercised by at least one test case. The value of t is usually referred to as strength. A large body of research exists about constructing test suites of small or moderate strength, typically t = 2 or 3;but very few techniques are known for constructing those of very high strength. This paper proposes the use of ZDD-based graph algorithms to construct a very high strength combinatorial test suite. Constructing high strength test suites is challenging because of the large number of interactions that must be handled during test suite construction. A ZDD is a data structure that can be used to enumerate a very large number of paths in an undirected graph and to perform operations on large sets of graphs. In our approach test cases and interactions are represented as subgraphs of the same graph. Using a ZDD-based graph library to operate on the graphs, we succeeded in constructing test suites of high strength up to t = 11 for some problem instances.

关键词： combinatorial interaction testing pair-wise testing zero-suppressed binary decision diagram (ZDD) graph theory greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Computing Sequence Covering Arrays using Unified combinatorial interaction testing 14

Computing Sequence Covering Arrays using Unified Combinatori...

引用

14th IEEE Conference on Software testing, Verification and Validation (ICST)

作者： Mercan, Hanefi Yilmaz, Cemal Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

ISBN: (纸本)9781665444569

Unified combinatorial interaction testing (U-CIT) aims to reduce the barriers to applying combinatorial interaction testing (CIT) approaches to different testing scenarios by generalizing the construction of the CIT objects, so that the necessity of developing a specialized constructor for each distinct scenario, is avoided. In this work, to demonstrate the flexibility provided by U-CIT, we apply it to compute a well-known combinatorial object for testing, namely sequence covering arrays, together with some practical extensions.

关键词： Unified combinatorial interaction testing sequence covering arrays combinatorial interaction testing constraint solving

来源：评论

学校读者我要写书评

暂无评论

CIT-daily: A combinatorial interaction testing-based daily build process

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2022年 190卷

作者： Mercan, Hanefi Aytar, Atakan Coskun, Giray Mustecep, Dilara Uzer, Gulsum Yilmaz, Cemal Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

In this work, we introduce an approach, called CIT-daily, which integrates combinatorial interaction testing (CIT) with the daily build processes to systematically test the interactions between the factors/parameters affecting the system's behaviors, on a daily basis. We also develop a number of CIT-daily strategies and empirically evaluate them on highly-configurable systems. The first strategy tests the same t-way covering array every day throughout the process, achieving a t-way coverage on a daily basis by covering each possible combination of option settings for every combination of t options. The other strategies, on the other hand, while guaranteeing a t-way coverage on a daily basis, aim to cover higher order interactions between the configuration options over time by varying the t-way covering arrays tested. In the experiments, we observed that the proposed approach significantly improved the effectiveness (i.e., fault revealing abilities) of the daily build processes;randomizing the coverage of higher order interactions between the configuration options while guaranteeing a base t-way coverage every day, further improved the effectiveness;and the more the higher order interactions covered during the process, the higher the fault revealing abilities tended to be. (C) 2022 Elsevier Inc. All rights reserved.

关键词： Daily build processes combinatorial interaction testing Covering arrays Software testing

来源：评论

学校读者我要写书评

暂无评论

Constrained locating arrays for combinatorial interaction testing

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2020年 170卷 110771-110771页

作者： Jin, Hao Tsuchiya, Tatsuhiro Osaka Univ Grad Sch Informat Sci & Technol 1-5 Yamadaoka Suita Osaka 5650871 Japan

This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in software testing. CLAs extend ordinary locating arrays to make them applicable to testing of systems that have constraints on test parameters. Such constraints are common in real-world systems;thus CLA enhances the applicability of locating arrays to practical testing problems. The paper also proposes an algorithm for constructing CLAs. Experimental results show that the proposed algorithm scales to problems of practical sizes. (C) 2020 The Authors. Published by Elsevier Inc.

关键词： combinatorial interaction testing Locating arrays Covering arrays Software testing

来源：评论

学校读者我要写书评

暂无评论

Constrained detecting arrays: Mathematical structures for fault identification in combinatorial interaction testing

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2023年 153卷

作者： Jin, Hao Shi, Ce Tsuchiya, Tatsuhiro Osaka Univ Yamadaoka 1-5 Suita Osaka Japan Shanghai Lixin Univ Accounting & Finance 2800 Wenxiang Rd Shanghai Peoples R China

Context: Detecting arrays are mathematical structures aimed at fault identification in combinatorial interaction testing. However, they cannot be directly applied to systems that have constraints on the test parameters. These constraints are prevalent in real-world ***: This paper proposes constrained detecting arrays (CDAs), an extension of detecting arrays, which can be used for systems with ***: The properties and capabilities of CDAs are examined with rigorous arguments. Moreover, two algorithms are proposed for constructing CDAs: one is aimed at generating minimum CDAs, and the other is a heuristic algorithm aimed at fast generation of CDAs. The algorithms were experimentally evaluated using a benchmark ***: Experimental results show that the first algorithm can generate minimum CDAs if a sufficiently long generation time is allowed, and the second algorithm can generate minimum or near-minimum CDAs in a reasonable ***: CDAs extend the range of application of detecting arrays to systems with constraints. The two proposed algorithms have different advantages with respect to array size and generation time.

关键词： combinatorial interaction testing Detecting arrays Constraint handling Fault identification

来源：评论

学校读者我要写书评

暂无评论

Controller-Centric combinatorial Wrap-Around interaction testing to Evaluate a Stateful PCE-Based Transport Network Architecture

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2017年第9期9卷 792-802页

作者： Choi, Jin Seek Hanyang Univ Div Comp Sci & Engn 17 Haengdang Dong Seoul 133791 South Korea

The objective of this paper is to develop a controller- centric combinatorial wrap-around interaction testing methodology for a stateful path computation element (PCE)-based transport network architecture. By exploiting the internal contexts of the controller-centric network in conjunction with combinatorial, wrap-around, and interaction testing methodologies, the proposed testing methodology helps test engineers build a highly configurable testing environment, select high-quality test cases to obtain the best possible combination of interactions, and prune fault cases or useless cases from all possible test cases throughout the entire development process as gray-box testing. The experimental results verify that the combined testing methodology effectively evaluates the controller-centric network for all testing processes in a completely controlled environment.

关键词： combinatorial interaction testing Context-aware interaction testing Controller-centric network Network integration testing Path computation element (PCE) Stateful PCE Wrap-around interaction testing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：