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

Automated test case generation for path coverage by using grey prediction evolution algorithm with improved scatter search strategy

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2021年 106卷 104454-104454页

作者： Cai, Gaocheng Su, Qinghua Hu, Zhongbo Yangtze Univ Sch Informat & Math Jingzhou Hubei Peoples R China

Automated test case generation for path coverage (ATCG-PC), as an important task in software testing, aims to achieve the highest path coverage of a tested program by using as little computational overhead as possible. In ATCG-PC, "similar paths are usually executed by similar test cases"is a problem-specific knowledge which was touched by a handful of researchers but still underutilized. Inspired by the problem-specific knowledge, this paper designs a local search strategy by improving a scatter search strategy, and then proposes a grey prediction evolution algorithm with the improved scatter search strategy for ATCG-PC. Here, the improved scatter search strategy could obtain two feasible test cases by exploiting a dimension of a test case covering a certain path. The proposed algorithm is constructed by importing the improved scatter search strategy to the end of the reproduction operation of the grey prediction evolution algorithm holding strong exploration ability. Grey prediction evolution algorithm is first applied to solve ATCG-PC. The performance of the proposed algorithm is evaluated on six fog computing benchmark programs and six natural language processing benchmark programs. The experimental results demonstrate that the proposed algorithm can achieve the highest path coverage with the fewer test cases and running time than some state-of-the-art algorithms.

关键词： Automated test case generation Grey prediction evolution algorithm Improved scatter search strategy path coverage

来源：评论

学校读者我要写书评

暂无评论

Multi-task collaborative method based on manifold optimization for automated test case generation based on path coverage

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 251卷

作者： Cao, Jie Huang, Han Liu, Fangqing Zhang, Qiuhong Hao, Zhifeng South China Univ Technol Sch Software Engn Guangzhou Peoples R China Shantou Univ Coll Sci Shantou Peoples R China

Automated test case generation based on path coverage is not only a large-scale black -box optimization problem, but also a key scientific problem in software automatic testing technology. Evolutionary algorithms and other search -based algorithms are representative methods for this problem. However, existing research mainly focuses on the multi -function case, where generating test cases for multiple functions is difficult due to the combinatorial explosion of the path number. In this paper, we propose a multi -task collaborative method based on manifold optimization by considering the topological manifold relationship between the test case space (decision space) and the program path space (target space). This method achieves the goal of collaborative optimization for different function coverage tasks by coordinating the allocation of computing resources and knowledge transfer mechanisms among them. To verify the effectiveness of the proposed method, we compare it with general solution methods for single -function automated test case generation based on path coverage, such as the manifold -inspired search -based algorithm. The experimental results show that the proposed method outperforms the compared single -function optimization algorithms especially on programs with strong coding similarities. This study verifies the feasibility of collaborative optimization methods for solving large-scale black -box optimization problems, such as the automated test case generation based on path coverage, and expands their application scenarios.

关键词： Test case generation path coverage Multi-task optimization Manifold optimization

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Algorithms for path coverage in Sensor Networks

引用

SENSORS 2023年第11期23卷 5026-5026页

作者： Liu, Zhixiong Zhou, Wei Changsha Univ Sch Comp Sci & Engn Changsha 410022 Peoples R China Swinburne Univ Technol Dept Comp Sci & Software Engn Hawthorn 3122 Australia

path coverage attracts many interests in some scenarios, such as object tracing in sensor networks. However, the problem of how to conserve the constrained energy of sensors is rarely considered in existing research. This paper studies two problems in the energy conservation of sensor networks that have not been addressed before. The first problem is called the least movement of nodes on path coverage. It first proves the problem as NP-hard, and then uses curve disjunction to separate each path into some discrete points, and ultimately moves nodes to new positions under some heuristic regulations. The utilized curve disjunction technique makes the proposed mechanism unrestricted by the linear path. The second problem is called the largest lifetime on path coverage. It first separates all nodes into independent partitions by utilizing the method of largest weighted bipartite matching, and then schedules these partitions to cover all paths in the network by turns. We eventually analyze the energy cost of the two proposed mechanisms, and evaluate the effects of some parameters on performance through extensive experiments, respectively.

关键词： sensor network path coverage least movement curve disjunction weighted bipartite matching

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Generation of Test Data for path coverage with Faults Detection

Evolutionary Generation of Test Data for Path Coverage with ...

引用

2011 Seventh International Conference on Natural Computation(第七届自然计算国际会议 ICNC 2011)

作者： Yan Zhang Dunwei Gong Yongjin Luo School of Information and Electrical Engineering China University of Mining and Technology Xuzhou J School of Information and Electrical Engineering China University of Mining and Technology Xuzhou J

The aim of software testing is to find faults in the program under test. Previous methods of path-oriented test data generation can generate test data traversing target paths, but they may not guarantee to find faults in the program. We present a method of evolutionary generation of test data for path coverage with faults detection in this paper. First, we establish a mathematical model of the problem considered in this paper, in which the number of faults detected in the path traversed by test data, and the risk level of faults are optimization objectives, and the approach level of the traversed path from the target one is a constraint. Then, we generate test data using a multi-objective evolutionary optimization algorithm with constraints. Finally, we apply the proposed method in a benchmark program bubble sort and an industrial program totinfo, and compare it with the traditional method. The experimental results conform that our method can generate test data that not only traverse the target path but also detect faults in it. Our achievement provides a novel way to generate test data for path coverage with faults detection.

关键词： software testing path coverage faults detection test data multi-objective evolutionary optimization

来源：评论

学校读者我要写书评

暂无评论

Microscale search-based algorithm based on time-space transfer for automated test case generation

引用

COMPLEX & INTELLIGENT SYSTEMS 2025年第2期11卷 1-19页

作者： Hong, Yinghan Liu, Fangqing Huang, Han Xiang, Yi Yan, Xueming Mai, Guizhen Guangzhou Maritime Univ Sch Comp Sci Sch Artificial Intelligence Guangzhou 510725 Guangdong Peoples R China Guangdong Univ Technol Sch Management Guangzhou 510520 Guangdong Peoples R China South China Univ Technol Sch Software Engn Guangzhou 510006 Guangdong Peoples R China Guangdong Univ Foreign Studies Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China

Automated test case generation for path coverage (ATCG-PC) is a major challenge in search-based software engineering due to its complexity as a large-scale black-box optimization problem. However, existing search-based approaches often fail to achieve high path coverage in large-scale unit programs. This is due to their expansive decision space and the presence of hundreds of feasible paths. In this paper, we present a microscale (small-size subsets of the decomposed decision set) search-based algorithm with time-space transfer (MISA-TST). This algorithm aims to identify more accurate subspaces consisting of optimal solutions based on two strategies. The dimension partition strategy employs a relationship matrix to track subspaces corresponding to the target paths. Additionally, the specific value strategy allows MISA-TST to focus the search on the neighborhood of specific dimension values rather than the entire dimension space. Experiments conducted on nine normal-scale and six large-scale benchmarks demonstrate the effectiveness of MISA-TST. The large-scale unit programs encompass hundreds of feasible paths or more than 1.00E+50 test cases. The results show that MISA-TST achieves significantly higher path coverage than other state-of-the-art algorithms in most benchmarks. Furthermore, the combination of the two time-space transfer strategies significantly enhances the performance of search-based algorithms like MISA, especially in large-scale unit programs.

关键词： Test case generation path coverage Large-scale optimization Relationship matrix Time-space transfer

来源：评论

学校读者我要写书评

暂无评论

Test Data Generation for Multiple paths Based on Local Evolution

引用

Chinese Journal of Electronics 2015年第1期24卷 46-51页

作者： YAO Xiangjuan GONG Dunwei WANG Wenliang College of Science China University of Mining and Technology School of Information and Electrical Engineering China University of Mining and Technology

Generating test data by genetic algorithms is a promising research direction in software testing, among which path coverage is an important test method. The efficiency of test data generation for multi-path coverage needs to be further improved. We propose a test data generation method for multi-path coverage based on a genetic algorithm with local evolution. The mathematical model is established for all target paths, while in the algorithm the individuals are evolved locally according to different objective functions. We can improve the utilization efficiency of test data. The computation cost can be reduced by using fitness functions of different granularity in different phases of the algorithm.

关键词： Test data generation path coverage Genetic algorithm Local evolution.

来源：评论

学校读者我要写书评

暂无评论

Vulnerability Detection in SIoT Applications: A Fuzzing Method on their Binaries

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2022年第3期9卷 970-979页

作者： Zhu, Xiaogang Wen, Sheng Jolfaei, Alireza Haghighi, Mohammad Sayad Camtepe, Seyit Xiang, Yang Swinburne Univ Technol Sch Software & Elect Engn Melbourne Vic 3000 Australia Macquarie Univ Dept Comp Sydney NSW 2109 Australia Univ Tehran Sch Elect & Comp Engn Tehran *** Iran DATA61 CSIRO Sydney NSW 2122 Australia

SIoT enables devices to communicate with each other automatically, which is not reliable when SIoT applications are vulnerable themselves. To improve the security of SIoT, different techniques have been employed so far, mainly to detect vulnerabilities in applications. Among the detection techniques, fuzzing is one of the most effective ones that can significantly improve the security of SIoT applications. However, the existing fuzzing methods have three problems. First of all, the schemes to instrument target binaries cause high memory overhead because they instrument at all edges to obtain the coverage information. Moreover, they introduce a severe problem called edge collision, i.e., two different edges are deemed the same during fuzzing. Thirdly, none of the existing fuzzers conduct fuzzing using path coverage because path coverage has high memory overhead. In this paper, we propose BECFuzz to resolve the above three problems. BECFuzz instruments at specific edges, and conducts fuzzing based on both edge coverage and path coverage, which greatly improves its effectiveness. We implement our BECFuzz based on two typical fuzzers which are widely recognised as baselines, AFL and AFLFast, and run experiments on 18 real-world programs. The results demonstrate that our method suppresses the state-of-art fuzzers in performance.

关键词： Fuzzing Instruments Image edge detection Computer bugs Internet of Things Security Static analysis Social Internet of Things IoT applications security fuzzing edge coverage path coverage

来源：评论

学校读者我要写书评

暂无评论

Scheduling sequence selection for generating test data to cover paths of MPI programs

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2019年 114卷 190-203页

作者： Sun, Baicai Wang, Jinxin Gong, Dunwei Tian, Tian China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Jiangsu Peoples R China Qingdao Univ Sci & Technol Sch Informat Sci & Technol Qingdao 266061 Shandong Peoples R China Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China

Context: As one of key tasks in software testing, test data generation has been receiving widespread attention in recent years. Message-passing Interface (MPI) programs, which are one representative type of parallel programs, have the characteristic of non-determinism, which is reflected by the non-deterministic execution under different scheduling sequences against the same program input. Previous studies have shown that different difficulties are raised in generating test data under different scheduling sequences, suggesting that selecting appropriate scheduling sequences is beneficial to a high efficiency. Objective: We propose a method of selecting a superior and feasible scheduling sequence for generating test data in the criterion of path coverage against each target path of an MPI program. Method: In the proposed method, a number of program inputs are first sampled by Latin hypercube sampling. Then, the program is executed against each sample under each scheduling sequence, and all the scheduling sequences are sorted according to the similarities between the paths traversed by these samples and the target one. Finally, the feasibility of a scheduling sequence with the best quality is investigated based on the symbolic execution. Results: We apply the proposed method to seven typical MPI programs and compare it with the random one. The experimental results show that test data covering the target path can be generated under the selected scheduling sequence with high success rate and low time consumption. Conclusion: The proposed method takes the influence of scheduling sequences on generating test data into consideration, thus providing a competent way to test parallel programs.

关键词： MPI program path coverage Test data generation Scheduling sequence Latin hypercube sampling

来源：评论

学校读者我要写书评

暂无评论

Test Suit Generation for Object Oriented Programs: A Hybrid Firefly and Differential Evolution Approach

引用

IEEE ACCESS 2020年 8卷 179167-179188页

作者： Panda, Madhumita Dash, Sujata Nayyar, Anand Bilal, Muhammad Mehmood, Raja Majid North Orissa Univ Master Comp Applicat MCA Baripada 757003 India Duy Tan Univ Grad Sch Da Nang 5500 Vietnam Hankuk Univ Foreign Studies Dept Comp & Elect Syst Engn Yongin 17035 South Korea Xiamen Univ Malaysia Sch Elect & Comp Engn Informat & Commun Technol Dept Sepang 43900 Malaysia Duy Tan Univ Fac Informat Technol Da Nang 550000 Vietnam

In model-based testing, the test suites are derived from design models of system specification documents instead of actual program codes to reduce cost and time of testing. In search-based software testing approach, the nature inspired meta-heuristic search algorithms are used for automating and optimizing the test suite generation process of software testing. This paper proposes a concrete model-based testing framework;using UML behavioral state chart model along with the hybrid version of the two most popular nature inspired algorithms, Firefly algorithm (FA) and Differential Algorithm (DE). The hybrid algorithm is adopted to generate optimized test suits for the benchmark triangle classification problem. Experimental results evidently show that the hybrid FA-DE search algorithm outperforms the individual model-based Firefly and Differential Evolution algorithm's performances in terms of time complexity, better exploration and exploitation as well as variations in test case generation process. The framework generates optimized test data for complete transition path coverage of the available feasible paths of the example problem.

关键词： Testing Object oriented modeling Unified modeling language Classification algorithms Software algorithms Optimization Analytical models Firefly algorithm differential evolution hybrid FA-DE algorithm object oriented testing path coverage search-based testing model-based testing

来源：评论

学校读者我要写书评

暂无评论

Measuring complexity and coverage of software specifications

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2000年第12期42卷 859-872页

作者： Walton, G Poore, JH Univ Cent Florida Sch Elect Engn & Comp Sci Orlando FL 32816 USA Univ Tennessee Dept Comp Sci Knoxville TN 37996 USA

coverage testing in the context of Markov chain usage models refers to coverage of a model of the specification and profile of intended use, rather than coverage of the code that implements the specification. A new measure of specification complexity based on the number of statistically typical paths through the model of the specification is derived. Formulae are presented to compute bounds on the expected number of test cases required to achieve state and are coverage. Formulae are presented to compare different usage models with respect to the amount of testing required to achieve coverage of typical paths. Convexity properties are established for these formulae to facilitate their use in optimization calculations that are used to generate transition probabilities for the usage models. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： Markov chain usage model statistical testing path coverage complexity optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：