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

An Empirical Comparison of the Efficiency and Effectiveness of Genetic Algorithms and Adaptive Random Techniques in data-flow testing

引用

IEEE ACCESS 2020年 8卷 12884-12896页

作者： Almansour, Fahad M. Alroobaea, Roobaea Ghiduk, Ahmed S. Qassim Univ Coll Sci & Arts Rass Dept Comp Sci Buraydah 51452 Saudi Arabia Taif Univ Coll Comp & Informat Technol At Taif 21974 Saudi Arabia Beni Suef Univ Fac Sci Dept Math & Comp Sci Bani Suwayf 62521 Egypt

Software testing depends on the execution of the tested-program against a set of test-inputs and the comparison of its outputs with the expected ones. The size of the input domain is very large that can be the set of real numbers (R). Thus, the selection of the appropriate inputs is one of the key problems in software testing. This process is time-consuming and needs a lot of effort and budget. Therefore, automatic inputs generation techniques are required to overcome these problems. Genetic algorithms (GAs) have been successfully used for generating test-inputs. Researchers proved that GAs overcame ordinary random search techniques (ORTs) in generating inputs. In addition, GAs can converge faster than ordinary random techniques and they can reduce effectively the size of the test-suite. Unfortunately, technically GAs needs time more than ORTs. Adaptive random testing technique (ART) is a form of ORT that works for distributing test-cases more evenly through the input domain to increase the efficiency of ORTs. So far, there is no study comparing the efficiency of GAs and ARTs in data-flow testing. In this paper, we introduce an empirical comparison for genetic algorithms and adaptive random techniques according to four factors: reducing the size of the test-suite, convergence speed, elapsed time, and the effectiveness in maximizing the coverage ratio of all du-pairs criterion. The experimental study, which was conducted to compare the two techniques, contains 7 Java programs. The results of the experiments showed that the GA technique defeated the ORT technique and the ART technique in reducing the size of the required test-suite to satisfy all du-pairs criterion. Where the GA technique created in total 31532 test-inputs while the ART technique generated 61841 and the ORT technique produced 32064. Further, the results showed that the GA technique converged faster than the ORT technique and the ART technique. Where the procedure of the GA technique was repeated 3153

关键词： Adaptive random testing data-flow testing genetic algorithms test data generation

来源：评论

学校读者我要写书评

暂无评论

An agent-based data-flow testing approach for Web applications

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2006年第12期48卷 1159-1171页

作者： Qi, Yu Kung, David Wong, Eric Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA

In recent years, Web applications (WAs) have grown so quickly that they have already become crucial to the success of businesses. However, since they are built on Internet and open standard technologies, WAs possess their own unique features, such as dynamic behaviors, heterogeneous representations, and novel data handling mechanisms. These features provide concrete support to the success of WAs, but they bring new challenges to researchers and developers, especially in regard to testing WAs and ensuring their quality. testing approaches for non-WAs have to be extended to handle these features before they are used in WA testing. This paper presents an agent-based approach to perform data-flow testing of WAs. More precisely, the data-flow testing will be performed by autonomous test agents at the method level, object level, and object cluster level, from low abstraction level to high abstraction level. In the process of the recommended data-flow testing, an agent-based WA testing system (WAT) will automatically generate and coordinate test agents to decompose the task of testing an entire WA into a set of subtasks that can be accomplished by test agents. The test agents, rooted in the Belief-Desire-Intention (BDI) model, cooperate with each other to complete the testing of a WA. An example is used to show the feasibility of the proposed approach. (C) 2006 Elsevier B.V. All rights reserved.

关键词： Web application testing data-flow testing agent-based framework

来源：评论

学校读者我要写书评

暂无评论

Dynamic data-flow testing 2014

Dynamic Data-Flow Testing

引用

36th International Conference on Software Engineering (ICSE)

作者： Vivanti, Mattia Univ Lugano Fac Informat CH-6904 Lugano Switzerland

ISBN: (纸本)9781450327688

data-flow testing techniques have long been discussed in the literature, yet to date they are still of little practical relevance. The applicability of data-flow testing is limited by the complexity and the imprecision of the approach: writing a test suite that satisfy a data-flow criterion is challenging due to the presence of many test objectives that include infeasible elements in the coverage domain and exclude feasible ones that depend on aliasing and dynamic constructs. To improve the applicability and effectiveness of data-flow testing we need both to augment the precision of the coverage domain by including data-flow elements dependent on aliasing and to exclude infeasible ones that reduce the total coverage. In my PhD research I plan to address these two problems by designing a new data-flow testing approach that combines automatic test generation and dynamic identification of data-flow elements that can identify precise test targets by monitoring the program executions.

关键词： data-flow testing dynamic data-flow analysis

来源：评论

学校读者我要写书评

暂无评论

A Survey on data-flow testing

引用

ACM COMPUTING SURVEYS 2017年第1期50卷 5-5页

作者： Su, Ting Wu, Ke Miao, Weikai Pu, Geguang He, Jifeng Chen, Yuting Su, Zhendong East China Normal Univ Sch Comp Sci & Software Engn Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

data-flow testing (DFT) is a family of testing strategies designed to verify the interactions between each program variable's definition and its uses. Such a test objective of interest is referred to as a def-use pair. DFT selects test data with respect to various test adequacy criteria (i.e., data-flow coverage criteria) to exercise each pair. The original conception of DFT was introduced by Herman in 1976. Since then, a number of studies have been conducted, both theoretically and empirically, to analyze DFT's complexity and effectiveness. In the past four decades, DFT has been continuously concerned, and various approaches from different aspects are proposed to pursue automatic and efficient data-flow testing. This survey presents a detailed overview of data-flow testing, including challenges and approaches in enforcing and automating it: (1) it introduces the data-flow analysis techniques that are used to identify def-use pairs;(2) it classifies and discusses techniques for data-flow-based test data generation, such as search-based testing, random testing, collateral-coverage- based testing, symbolic-execution-based testing, and model-checking-based testing;(3) it discusses techniques for tracking data-flow coverage;(4) it presents several DFT applications, including software fault localization, web security testing, and specification consistency checking;and (5) it summarizes recent advances and discusses future research directions toward more practical data-flow testing.

关键词： data-flow testing coverage criteria data-flow analysis test data generation coverage tracking

来源：评论

学校读者我要写书评

暂无评论

Neural Network Based Test Case Generation for data-flow Oriented testing 1

Neural Network Based Test Case Generation for Data-flow Orie...

引用

1st IEEE International Conference on Artificial Intelligence testing (IEEE AITest)

作者： Ji, Shunhui Chen, Qin Zhang, Pengcheng Hohai Univ Coll Comp & Informat Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781728104928

data-flow oriented testing plays an important role in software quality assurance. Many researches applied genetic algorithm to automatically generating test cases. However, each test case needs the run of program so as to compute its fitness value in most researches, which costs a lot. This paper proposes a neural network based approach for all-uses criterion oriented test case generation. The DU-pairs that need to be tested are calculated firstly. Then BP neural network is trained to simulate the fitness function. Finally, genetic algorithm is used to generate test cases where fitness value of each test case is evaluated with the trained neural network.

关键词： data-flow testing Test Case Generation Neural Network Genetic Algorithm

来源：评论

学校读者我要写书评

暂无评论

The collateral coverage of data flow criteria when branch testing

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2006年第8期48卷 676-686页

作者： Malevris, N. Yates, D. F. Athens Univ Econ & Business Dept Informat Athens Greece Athens Univ Econ & Business Dept Informat Informat Syst & Databases Lab Athens Greece

When exercising program code with test data in an attempt to satisfy a given testing criterion, there will be a concurrent accrual of coverage in respect of other testing criteria. Knowledge of the extent of such 'collateral coverage' can be used to advantage both in providing better estimates of the overheads entailed by the overall testing exercise, and in helping to determine an optimal sequence for the application of a set of testing methods. In this paper, the results deriving from a set of experiments are reported. The aim of the experiments was to investigate the extent of the collateral coverage that is achieved in respect of the data-flow testing criteria when branch testing is undertaken. (c) 2005 Elsevier B.V. All rights reserved.

关键词： branch testing data-flow testing collateral coverage infeasible paths

来源：评论

学校读者我要写书评

暂无评论

Coverage testing of Java programs and components

引用

SCIENCE OF COMPUTER PROGRAMMING 2005年第1-2期56卷 211-230页

作者： Vincenzi, AMR Maldonado, JC Wong, WE Delamaro, ME Univ Sao Paulo Inst Ciencias Matemat & Computacao BR-13560 Sao Carlos SP Brazil Univ Texas Dept Comp Sci Richardson TX 75080 USA Ctr Univ Euripides Marilia BR-17525901 Marilia SP Brazil

Although software testing is a crucial activity in the software development process, only recently have more sound and consistent testing tools become available for testing Java programs and their components. These tools support mostly functional and control-flow based structural criteria. In this paper we explore control-flow and data-flow based coverage criteria to support the testing of Java programs and/or components. We also describe a testing tool, named JaBUTi, which can be used by both the component developer and the component user to test Java-based components and/or systems. To achieve this goal, the tool works at the bytecode level such that no source code is required during the testing activity. We illustrate these ideas and concepts with an example extracted from the literature. (c) 2004 Elsevier B.V. All rights reserved.

关键词： Java program testing Java component testing Java bytecode structural testing control-flow testing data-flow testing

来源：评论

学校读者我要写书评

暂无评论

CONSTRAINT PRESERVATION THROUGH LOOPS

引用

INFORMATION PROCESSING LETTERS 1995年第3期55卷 143-148页

作者： NIKOLIK, B Department of Computer and Information Science University of Oregon Eugene OR 97402 USA

Program constraints are declarative statements expressing relations among programming objects such as reals, integers, and strings. Many problems in program analysis involve determining if a program constraint is satisfiable on all paths in a given collection. We give conditions that guarantee the satisfiability of a program constraint on all paths in a potentially infinite collection. Our conditions are necessary and sufficient to decide certain array dataflow problems, such as whether two array references refer to the same element on a potential infinity of paths, and determining the existence of a def-clear path.

关键词： SOFTWARE ENGINEERING PROGRAM ANALYSIS CONSTRAINT PRESERVATION data-flow testing ARRAYS

来源：评论

学校读者我要写书评

暂无评论

Test cases selection from SDL specifications

引用

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING 2001年第6期35卷 693-708页

作者： Bourhfir, C Aboulhamid, E Khendek, F Dssouli, R Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada

Selecting appropriate test cases is a crucial activity in software testing. In this paper, we give an overview and discuss existing methods and tools for test case selection for communication protocols. More precisely, we are interested in techniques for test case generation from specification and description language (SDL) specifications and its underlying behavioral model, extended finite state machines (EFSM) and its variants. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： test selection SDL EFSM data-flow testing control-flow testing test criteria

来源：评论

学校读者我要写书评

暂无评论

A COVERAGE ANALYSIS TOOL FOR THE EFFECTIVENESS OF SOFTWARE testing

引用

IEEE TRANSACTIONS ON RELIABILITY 1994年第4期43卷 527-535页

作者： LYU, MR HORGAN, JR LONDON, S Bell Communications Research Inc. Morristown USA

This paper describes the software testing and analysis tool, ''ATAC (Automatic Test Analysis for C)'', developed as a research instrument at Bellcore to measure the effectiveness of testing data. It is also a tool to facilitate the design and evaluation of test cases during software development. To demonstrate the capability and applicability of ATAC, we obtained 12 program versions of a critical industrial application developed in a recent university/industry N-Version Software project, and used ATAC to analyze and compare coverage of the testing on the program versions. Preliminary results from this investigation show that ATAC is a powerful testing tool to provide testing metrics and quality control guidance for the certification of high quality software components or systems. In using ATAC to derive high quality test data, we assume that a good test has a high data-flow coverage score. This hypothesis requires that we show that good data-flow testing implies good software, viz, software with higher reliability, One would hope, for example, that code tested to 85% c-uses coverage would have a lower field-failure rate than similar code tested to 20% c-uses coverage. The establishment of a correlation between good data-flow testing and a low (or zero) rate of field failures is the ultimate and critical test of the usefulness of data-flow coverage testing. We demonstrated by ATAC that the 12 program versions obtained from the U. of Iowa and Rockwell NVS project (a project that has been subjected to a stringent design, implementation, and testing procedure) had very high testing coverage scores of blocks, decisions, c-uses, and p-uses. Results from the field testing (in which only one fault was found) confirmed this belief. The ultimate question that we hope ATAC can help us ans,ver is a typical question for all software reliability engineers: ''When is a program considered acceptable?'' Software reliability analysts have proposed several models to answer this questi

关键词： data-flow testing TEST EFFECTIVENESS testing COVERAGE TOOL SOFTWARE METRIC N-VERSION PROGRAMMING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：