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

Dependence Guided Symbolic Execution

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2017年第3期43卷 252-271页

作者： Wang, Haijun Liu, Ting Guan, Xiaohong Shen, Chao Zheng, Qinghua Yang, Zijiang Xi An Jiao Tong Univ Minist Educ Key Lab Intelligent Networks & Network Secur MOEK Sch Elect & Informat Engn Xian 710049 Peoples R China Western Michigan Univ Dept Comp Sci Kalamazoo MI 49008 USA

Symbolic execution is a powerful technique for systematically exploring the paths of a program and generating the corresponding test inputs. However, its practical usage is often limited by the path explosion problem, that is, the number of explored paths usually grows exponentially with the increase of program size. In this paper, we argue that for the purpose of fault detection it is not necessary to systematically explore the paths, and propose a new symbolic execution approach to mitigate the path explosion problem by predicting and eliminating the redundant paths based on symbolic value. Our approach can achieve the equivalent fault detection capability as traditional symbolic execution without exhaustive path exploration. In addition, we develop a practical implementation called Dependence Guided Symbolic Execution (DGSE) to soundly approximate our approach. Through exploiting program dependence, DGSE can predict and eliminate the redundant paths at a reasonable computational cost. Our empirical study shows that the redundant paths are abundant and widespread in a program. Compared with traditional symbolic execution, DGSE only explores 6.96 to 96.57 percent of the paths and achieves a speedup of 1.02 x to 49.56 x. We have released our tool and the benchmarks used to evaluate DGSE.

关键词： Symbolic execution path coverage program dependence

来源：评论

学校读者我要写书评

暂无评论

A study on a path-based strategy for selecting black-box generated test cases

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2001年第2期11卷 113-138页

作者： Yu, YT Tang, SF Poon, PL Chen, TY City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Hong Kong Polytech Univ Dept Accountancy Kowloon Hong Kong Peoples R China Swinburne Univ Technol Sch Informat Technol Hawthorn Vic 3122 Australia

Various black-box methods for the generation of test cases have been proposed in the literature. Many of these methods, including the category-partition method and the classification-tree method, follow the approach of partition testing, in which the input domain is partitioned into subdomains according to important aspects of the specification, and test cases are then derived from the subdomains. Though comprehensive in terms of these important aspects, execution of all the test cases so generated may not be feasible under the constraint of tight testing resources. In such circumstances, there is a need to select a smaller subset of test cases from the original test suite for execution. In this paper, we propose the use of white-box information to guide the selection of test cases from the original test suite generated by a black-box testing method. Furthermore, we have developed some techniques and algorithms to facilitate the implementation of our approach, and demonstrated its viability and benefits by means of a case study.

关键词： category-partition method classification-tree method partition testing path coverage test case selection

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm based test data generation for MPI parallel programs with blocking communication

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2019年第0期155卷 130-144页

作者： Tian, Tian Gong, Dunwei Kuo, Fei-Ching Liu, Huai Shandong Jianzhu Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China China Univ Min & Technol Sch Informat & Control Engn Xuzhou 221116 Jiangsu Peoples R China Swinburne Univ Technol Dept Comp Sci & Software Engn Hawthorn Vic 3122 Australia

Parallel computing is one of mainstream techniques for high-performance computation in which MPI parallel programs have gained more and more attention. Genetic algorithms (GAs) have been widely employed in automated test data generation, leading to a major family of search-based software testing techniques. However, previous GA-based methods have limitations when testing MPI parallel programs with blocking communication. In this paper, we focus on the path coverage problem for MPI parallel programs with blocking communication, and formulate the problem as an optimization problem with its decision variable being the program input and the execution order of sending nodes. In addition, we develop target amending strategies for candidates when solving the problem using genetic algorithms. The proposed method is evaluated and compared with several state-of-the-art methods through a series of controlled experiments on five typical programs. The experimental results show that the proposed method can effectively and efficiently generate test data for path coverage. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Parallel program Blocking communication path coverage Test data Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

On the coverage Process of a Moving Point Target in a Non-Uniform Dynamic Sensor Field

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2009年第7期27卷 1245-1255页

作者： Manohar, Pallavi Manjunath, D. Indian Inst Technol Bharti Ctr Commun Dept Elecl Engg Bombay Maharashtra India

We analyze the statistical properties of the k-coverage of a point-target moving in a straight line in a non-uniform dynamic sensor field. Sensor locations form a spatial point process. The environmental variation is captured by making the sensor locations form a non homogeneous spatial Poisson process with a fixed, spatially varying density function. The sensing areas of the sensors are circles of i.i.d. radii. The availability of each node is modeled by an independent, {0, 1}-valued, continuous time Markov chain. This gives a Markov-non homogeneous Poisson-Boolean model for which we perform a coverage analysis. We first obtain k-coverage of the target at an arbitrary time instant. We then obtain k-coverage statistics of the target during the time interval [0, T]. We also provide an asymptotically tight, closed form approximation for the duration for which the target is not k-covered in [0, T]. Numerical results illustrate the analysis. The environmental variation can also be captured by modeling the density function as a spatial random process resulting in the point process being a two-dimensional Cox process. For this model, we discuss issues in the coverage analysis.

关键词： non-uniform sensor density k-coverage path coverage Markov-Boolean model target tracking

来源：评论

学校读者我要写书评

暂无评论

Quantification of Software Code coverage Using Artificial Bee Colony Optimization Based on Markov Approach

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2017年第8期42卷 3503-3519页

作者： Boopathi, Muthusamy Sujatha, Ramalingam Senthil Kumar, Chandran Narasimman, Srinivasan SSN Coll Engn Dept Math Kalavakkam 603110 India Atom Energy Regulatory Board Safety Res Inst Kalpakkam 603102 Tamil Nadu India

Software test suite generation and development of techniques to optimize the test suite are vital parts of the software development life cycle. In this paper, a combination of Markov chain and artificial bee colony (ABC) optimization techniques are adopted to attain the software code coverage. Initially, dd-graph is captured from the control flow graph of the source code and is represented as a Markov chain. The number of paths is obtained based on linear code sequence and jump (LCSAJ) coverage. LCSAJ is used to reduce the number of independent paths as compared to paths obtained by basis path testing. Automatic test cases are generated and based on the operation profile of the test suite;transition probabilities are obtained using gcov analysis tool. Further, ABC optimization is adopted to ensure software code coverage. The initial population is randomly selected from the test suite and populated for subsequent generations using the ABC algorithm. The test cases are generated for three mixed data type variables, namely integer, float and Boolean. The quality of the test cases is improved during every iteration of ABC optimization and traversed through number of LCSAJ-based independent paths thereby ensuring software code coverage. Finally, software code coverage is quantified using the fitness/happiness value computed as a product of node coverage and the corresponding transition probability values based on the path covered.

关键词： Artificial bee colony Markov chain Dd-graph LCSAJ coverage Initial test suite path coverage

来源：评论

学校读者我要写书评

暂无评论

Connecting priority algorithm for node deployment in directional sensor networks

引用

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2017年第1期8卷 29-37页

作者： Tan, Li Chen, Yucheng Yang, Minghua Hu, Jipeng Lian, Jingjing Beijing Technol & Business Univ Sch Comp & Informat Engn Dept Comp Sci 11 Fucheng RdPOB 100048 Beijing Peoples R China

According to the existing directional sensor networks, the centroid point of node model mostly rotate around the sector vertex. As in this model, the node rotation area is a full circle, therefore multiply the network energy consumption and deployment time. This paper is based on the new directional model in which the sector nodes rotate around the centroid, then we present a potential field based connecting priority algorithm for node deployment, and finally make simulation for this algorithm to explore the parameters which will affect the coverage ratio. The simulation results show the effectiveness of the model and algorithm.

关键词： directional sensor networks directional sensing model virtual potential field path coverage

来源：评论

学校读者我要写书评

暂无评论

Experimental Testing of a path Manager for Unmanned Surface Vehicles in Survey Missions

引用

IFAC-PapersOnLine 2018年第29期51卷 226-231页

作者： Iovino, S. Savvaris, A. Tsourdos, A. Cranfield University CranfieldBedfordshireMK43 0AL United Kingdom

This paper presents the experimental testing of an intermediate guidance level for Unmanned Surface Vehicles (USV). The work aims to deal with specific requirements when the execution of survey operations is performed. The necessities in terms of path coverage can be different throughout the mission and the possibility to take them into account in the mission plan, thereby obtaining an appropriate and feasible path plan, constitutes an enhancing capability. In order to tackle the mission requirements, four different turn types are defined. The computed path is constituted by a sequence of straight-lines and circular arcs, hence allowing the use of existing path following methods. An architecture consisting of a payload computer and the unmanned surface vehicle C-Worker 5 by ASV Global Ltd, connected through a Robot Operating System (ROS) network and a radio datalink, has been implemented to execute sea trials and experimentally validate the proposed guidance. Experimental results are presented and the cross track error measurements as well as the percentage of covered path are considered in the analysis. © 2018

关键词： Unmanned surface vehicles Computer operating systems Control engineering Managers Robots Surface testing Surveys Vehicles Autonomous Vehicles Cross track errors Experimental testing Mission requirements path coverage path following methods Robot operating systems (ROS) Sea trial

来源：评论

学校读者我要写书评

暂无评论

Search-Based Algorithm With Scatter Search Strategy for Automated Test Case Generation of NLP Toolkit

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE 2021年第3期5卷 491-503页

作者： Liu, Fangqing Huang, Han Yang, Zhongming Hao, Zhifeng Wang, Jiangping South China Univ Technol Sch Software Engn Guangzhou 510006 Peoples R China Jilin Univ Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Peoples R China Guangdong Inst Sci & Technol Coll Comp Engn Tech Zhuhai 510640 Peoples R China Guangdong Univ Technol Sch Comp Guangzhou 510090 Peoples R China Foshan Univ Sch Math & Big Date Foshan 528000 Peoples R China BeMing Software Co Ltd Guangzhou 510663 Peoples R China

Natural language processing (NLP), as a theory-motivated computational technique, has extensive applications. Automated test case generation based on path coverage, which is a popular structural testing activity, can automatically reveal logic defects that exist in NLP programs and can save testing consumption. NLP programs have many paths that can only be covered by specific input variables. This feature makes conventional search-based algorithm very difficult covering all possible paths in NLP programs. A strategy is required for improving the search ability of search-based algorithms. In this paper, we propose a scatter search strategy to automatically generate test cases for covering all possible paths of NLP programs. The scatter search strategy empowers search-based algorithms to explore all input variables and cover the paths that require specific input variables within a small amount of test cases. The experiment results show that the proposed scatter search strategy can quickly cover the paths, which requires specific input variables. Many test cases and running time consumptions will be saved when search-based algorithms combine with scatter search strategy.

关键词： Search problems Natural language processing Input variables Mathematical model Testing Genetic algorithms Optimization Automated test case generation path coverage natural language processing search-based algorithm scatter search

来源：评论

学校读者我要写书评

暂无评论

Data Flow Based Test Case Generation Algorithm for Object Oriented Integration Testing 6

Data Flow Based Test Case Generation Algorithm for Object Or...

引用

6th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Waheed, Shahzada Zeeshan Qamar, Usman NUST Pakistan Natl Univ Sci & Technol Dept Comp Engn Islamabad Pakistan

ISBN: (纸本)9781479983537

Testing is way of insuring quality of the product. Object oriented testing is challenging task. It becomes more intense in integration level when different units interact for proper functioning of system. These Interacting Objects must be in desired state to achieve the required coverage. This can be achieved by generating method sequences. Manually test case generation is a tedious job and in object oriented testing method explosion make it worst. In this paper we propose a novel approach for test case generation of object oriented integration testing. Search space is reduced by selecting the coupling methods that are directly involved in integration. Further def-use analysis helps in achieving the desired object states for proper interfaces testing, representing methods in testing tree. This paper also identifies problematic cases and their solutions in method sequence generation. Results shown significant improvements in object oriented integration testing.

关键词： path coverage Test criteria Test cases DU-analysis SUT Object Oriented Testing

来源：评论

学校读者我要写书评

暂无评论

Application of Genetic Algorithm in Automatic Software Testing

Application of Genetic Algorithm in Automatic Software Testi...

引用

2nd International Conference on Networked Digital Technologies

作者： Babamir, Faezeh Sadat Hatamizadeh, Alireza Babamir, Seyed Mehrdad Dabbaghian, Mehdi Norouzi, Ali Shahid Bahonar Univ Kerman Dept Comp Sci Kerman Iran Natl Acad Sci Inst IT Azerbaijan Baku Azerbaijan Sharif Univ Technol Dept Elect Engn Tehran Iran Roozbeh Inst Higer Educ Dept Comp Engn Zanjan Iran Tech Univ Istanbul Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9783642143052

One of the major challenge and time-consuming work is optimum test data generation to assure software quality. Researchers have proposed several methods over years to generate automatically solution which have different drawbacks. In this paper, we propose Genetic Algorithm (GA) based tester with different parameters to automate the structural-oriented test data generation on the basis of internal program structure. Our proposed fitness function is intended to traverse paths of the program as more as possible. This integration improves the GA performance in search space exploration and exploitation fields with faster convergence. At last, we present some results according to our experiment which were promising in term of structural coverage and time order.

关键词： Test data Generation Software quality Genetic Algorithm Structural testing path coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：