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

covering array Constructors: An Experimental Analysis of Their Interaction Coverage and Fault Detection

COMPUTER JOURNAL 2021年第5期64卷 762-788页

作者： Huang, Rubing Chen, Haibo Zhou, Yunan Chen, Tsong Yueh Towey, Dave Lau, Man Fai Ng, Sebastian Merkel, Robert Chen, Jinfu Jiangsu Univ Sch Comp Sci & Commun Engn Zhenjiang 212013 Jiangsu Peoples R China Jiangsu Univ Jiangsu Key Lab Secur Technol Ind Cyberspace Zhenjiang 212013 Jiangsu Peoples R China Jiangsu Univ Sch Comp Sci & Commun Engn Zhenjiang 202013 Jiangsu Peoples R China Swinbume Univ Technol Dept Comp Sci & Software Engn Hawthorn Vic 3122 Australia Univ Nottingham Ningbo China Sch Comp Sci Ningbo 315100 Zhejiang Peoples R China Monash Univ Fac Informat Technol Clayton Vic 3168 Australia

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.

关键词： combinatorial interaction testing covering array constructor empirical study software testing

来源：评论

学校读者我要写书评

暂无评论

Selecting the Best Wild Card Entries in a covering array

引用

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL 2017年第7期33卷 1615-1627页

作者： Kim, Youngil Jang, Dae-Heung Anderson-Cook, Christine M. Chung Ang Univ Coll Business Seoul South Korea Pukyong Natl Univ Dept Stat Busan South Korea Los Alamos Natl Lab Stat Sci Grp Los Alamos NM 87544 USA

For some covering arrays, there are some wild card positions in the array where there is flexibility about what factor levels can be chosen with no impact on the basic properties of covering array, because all of the required pairs have been covered. The choice of how to fill these wild card positions can influence other properties, such as the degrees of orthogonality or three-way coverage of the array. In this paper, some criteria are proposed for identifying the best choices for the wild card positions to create covering arrays with highly desirable properties. Accompanying graphical summaries are also described to highlight differing performance for several examples. Copyright (c) 2017 John Wiley & Sons, Ltd.

关键词： orthogonal array covering array strength of 1 strength of 2 three-way coverage missing Monte Carlo simulation optimization

来源：评论

学校读者我要写书评

暂无评论

An efficient strategy for covering array construction with fuzzy logic-based adaptive swarm optimization for software testing use

引用

EXPERT SYSTEMS WITH APPLICATIONS 2015年第22期42卷 8753-8765页

作者： Mahmoud, Thair Ahmed, Bestoun S. Edith Cowan Univ Sch Engn Joondalup WA 6027 Australia SUH Engn Coll Software Engn Dept Erbil 44002 Kurdistan Iraq

Recent research activities have demonstrated the effective application of combinatorial optimization in different areas, especially in software testing. covering array (CA) has been introduced as a representation of the combinations in one complete set. CA(lambda)(N;t, k, v) is an N x k array in which each t-tuple for an N x t sub array occurs at least times, where t is the combination strength, k is the number of components (factors), and v is the number of symbols for each component (levels). Generating an optimized covering array for a specific number of k and v is difficult because the problem is a non-deterministic polynomial-time hard computational one. To address this issue, many relevant strategies have been developed, including stochastic population-based algorithms. This paper presents a new and effective approach for constructing efficient covering arrays through fuzzy-based, adaptive particle swarm optimization (PSO). With this approach, efficient covering arrays have been constructed and the performance of PSO has been improved for this type of application. To measure the effectiveness of the technique, an empirical study is conducted on a software system. The technique proves its effectiveness through the conducted case study. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： covering array Fuzzy logic Combinatorial design Particle swarm optimization Software testing Test generation tools Search-based software engineering

来源：评论

学校读者我要写书评

暂无评论

Two-stage algorithms for covering array construction

引用

JOURNAL OF COMBINATORIAL DESIGNS 2019年第8期27卷 475-505页

作者： Sarkar, Kaushik Colbourn, Charles J. Arizona State Univ Sch Comp Informat & Decis Syst Engn POB 878809 Tempe AZ 85287 USA

Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. covering arrays are used to test for interactions among components systematically. A two-stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. In the first stage, a time and memory efficient randomized algorithm covers most of the interactions. In the second stage, a more sophisticated search covers the remainder in relatively few tests. In this way, the storage limitations of the sophisticated search algorithms are avoided;hence, the range of the number of components for which the algorithm can be applied is extended, without increasing the number of tests. Many of the framework instantiations can be tuned to optimize a memory-quality trade-off, so that fewer tests can be achieved using more memory.

关键词： conditional expectation covering array Lovasz local lemma randomized algorithm two-stage algorithm

来源：评论

学校读者我要写书评

暂无评论

GALP: a hybrid artificial intelligence algorithm for generating covering array (Apr, 10.1007/s00500-021-05788-0, 2021)

引用

SOFT COMPUTING 2021年第11期25卷 7691-7691页

作者： Esfandyari, Sajad Rafe, Vahid Arak Univ Fac Engn Dept Comp Engn Arak *** Iran

A correction to this paper has been published: https://***/10.1007/s00500-021-05848-5

关键词： ALPSOFV Combinatorial testing covering array Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

State of the CArt: evaluating covering array generators at scale

引用

INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER 2024年第3期26卷 301-326页

作者： Leithner, Manuel Bombarda, Andrea Wagner, Michael Gargantini, Angelo Simos, Dimitris E. Univ Bergamo Dept Engn Bergamo Italy SBA Res Vienna Austria

Providing a reusable methodology for the evaluation of covering array generation utilities and apply it to a corpus of such tools, obtaining an overview of supported features and constraints, performance, output size, file formats, and practical considerations that may ease or hinder *** of supported capabilities, input and output formats, and constraints, followed by an experimental evaluation of eight covering array generation tools, two of which were provided in updated versions, against a corpus of 295 publicly available benchmark models in six categories, producing arrays of strength two to ***, particularly constraint support, vary widely amongst competitors. Metaheuristic algorithms, commonly focused on postoptimization, tend to produce small arrays at the cost of performance. Approaches based on the In-Parameter-Order paradigm offer a good balance between speed and output size that may prove conducive to real-world *** choice of a covering array generation utility should be based on specific requirements related to the use case. Nevertheless, our evaluation identifies some candidates - CAgen, ACTS, and APPTS - which lead the field in terms of overall score. Others, such as PICT, offer unique features;however, a lack of standardization may lead to vendor lock-in.

关键词： Combinatorial testing covering array Competition Benchmark Combinatorial test generators Test suite generation time Test suite size covering array generation

来源：评论

学校读者我要写书评

暂无评论

Empirically Identifying the Best Greedy Algorithm for covering array Generation

Empirically Identifying the Best Greedy Algorithm for Coveri...

引用

6th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Nie, Changhai Jiang, Jing Wu, Huayao Leung, Hareton Colbourn, Charles J. Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China Hong Kong Polytech Univ Dept Comp Kowloon Peoples R China Arizona State Univ State Key Lab Softwareb Dev Environm Tempe AZ 85287 USA Beihang Univ Beijing 100191 Peoples R China

ISBN: (纸本)9780769549934;9781479913244

covering array generation is a key issue in combinatorial testing. A number of researchers have been applying greedy algorithms for covering array construction. A greedy framework has been built to integrate most greedy algorithms and evaluate new approaches derived from this framework. However, this framework is affected by multiple factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we propose a search method that combines pairwise coverage with either base choice or hill climbing techniques. We conduct three different groups of experiments based on six decisions of the greedy framework. The influence of these decisions and their interactions are studied systematically, and the selected greedy algorithm for covering array generation is shown to be better than the existing greedy algorithms.

关键词： combinatorial testing greedy methods covering array

来源：评论

学校读者我要写书评

暂无评论

Using Parameter Mapping to Avoid Forbidden Tuples in a covering array 12

Using Parameter Mapping to Avoid Forbidden Tuples in a Cover...

引用

12th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Rao, Chang Li, Nan Lei, Yu Kacker, Raghu N. Kuhn, D. Richard Guo, Jin Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu Sichuan Peoples R China Medidata Solut Res & Dev New York NY USA Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA NIST Informat & Technol Lab Gaithersburg MD 20899 USA

ISBN: (纸本)9781728108889

This paper addresses an optimization problem that occurs when we try to remove from a covering array (CA) the rows that do not satisfy a given set of constraints. That is, how to minimize the number of rows to be removed? The key observation is that the columns of a CA can be swapped without affecting coverage. This makes it possible to explore different ways to map the parameters involved in the constraints to the columns in the CA, which further allows us to reduce the number of rows that must be removed. In order to find an optimal mapping, our approach maps one parameter at a time and employs a greedy algorithm that tries to minimize the number of rows to be removed at each step. We report several experiments in which we compared our approach to two other approaches, i.e., the identity-based approach, and the random approach. The results show that our approach can remove fewer rows than the other two approaches.

关键词： Combinatorial Testing Constraints covering array Parameter Mapping Removing Invalid Rows

来源：评论

学校读者我要写书评

暂无评论

covering array on the Cartesian Product of Hypergraphs

引用

GRAPHS AND COMBINATORICS 2024年第4期40卷 87-87页

作者： Akhtar, Yasmeen Maity, Soumen Birla Inst Technol & Sci Pilani Dept Math K K Birla Goa CampusNH17B Bypass Rd Sancoale 403726 Goa India Indian Inst Sci Educ & Res Dept Math Dr Homi Bhabha Rd Pune 411008 Maharashtra India

covering array (CA) on a hypergraph H is a combinatorial object used in interaction testing of a complex system modeled as H. Given a t-uniform hypergraph H and positive integer s, it is an array with a column for each vertex having entries from a finite set of cardinality s, such as Z(s), and the property that any set of t columns that correspond to vertices in a hyperedge covers all s(t) ordered t-tuples from Z(s)(t) at least once as a row. Minimizing the number of rows (size) of CA is important in industrial applications. Given a hypergraph H, a CA on H with the minimum size is called optimal. Determining the minimum size of CA on a hypergraph is NP-hard. We focus on constructions that make optimal covering arrays on large hypergraphs from smaller ones and discuss the construction method for optimal CA on the Cartesian product of a Cayley hypergraph with different families of hypergraphs. For a prime power q > 2, we present a polynomial-time approximation algorithm with approximation ratio ([log(q) (vertical bar V vertical bar/3(k-1))])(2) for constructing covering array CA(n, H, q) on 3-uniform hypergraph H = (V, E) with k > 1 prime factors with respect to the Cartesian product.

关键词： covering array Cartesian product Cayley hypergraph Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

An Experimental Analysis of Fault Detection Capabilities of covering array Constructors 18

An Experimental Analysis of Fault Detection Capabilities of ...

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Huang, Rubing Zhou, Yunan Chen, Tsong Yueh Towey, Dave Chen, Jinfu Jiangsu Univ Zhenjiang Peoples R China Swinburne Univ Technol Hawthorn Vic Australia Univ Nottingham Ningbo China Ningbo Zhejiang Peoples R China

ISBN: (纸本)9781450356633

Combinatorial Interaction Testing (CIT) aims at constructing an effective test suite, such as a covering array (CA), that can detect faults that are caused by the interaction of parameters. In this paper, we report on some empirical studies conducted to examine the fault detection capabilities of five popular CA constructors: ACTS, Jenny, PICT, CASA, and TCA. The experimental results indicate that Jenny has the best performance, because it achieves better fault detection than the other four constructors in many cases. Our results also indicate that CAs generated using ACTS, PICT, or CASA should be prioritized before testing.

关键词： Combinatorial Interaction Testing covering array Constructor Empirical Study Software Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：