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

Preventing untestedness in data-flow based testing

SOFTWARE testing VERIFICATION & RELIABILITY 2002年第1期12卷 29-58页

作者： Forgács, I Bertolino, A CNR Ist Elaboraz Informaz I-56100 Pisa Italy Balthazar Ltd Budapest Hungary

A large number of path-oriented testing criteria have been proposed in the last twenty years. Surprisingly, almost all of them suffer from a serious weakness, which is called the untestedness syndrome: even though a criterion is satisfied, sonic statements of the program under test may remain `untested', i.e., the observed test output does not depend on them. A new data-flow based testing criterion is introduced which does not suffer from untestedness, called the All Program Function (APF) criterion. Intuitively, it requires that each possible computation to every output statement in a program be covered by some test;but for lots of programs APF would require an infinite number of tests. A second, applicable criterion is thus introduced, derived from APF and called the Basic Program Function (BPF) criterion. BPF leaves no statement untested and yields finite test suites. Some examples show the application of BPF and investigate the failure-detection capability of the proposed criterion. Copyright (C) 2001 John Wiley Sons, Ltd.

关键词： data flow testing influencing chain set path-oriented criterion program function untestedness syndrome

来源：评论

学校读者我要写书评

暂无评论

Automatic data flow class testing based on 2-step heterogeneous process using evolutionary algorithms

引用

JOURNAL OF STATISTICS & MANAGEMENT SYSTEMS 2019年第7期22卷 1315-1348页

作者： Jain, Neetu Porwal, Rabins Kumar, Sumit Varshney, Sapna Saraswat, Mukesh Mewar Univ Dept Comp Sci & Informat Sci Chittaurgarh 312901 Rajasthan India Lal Bahadur Shastri Inst Management Dwarka Sect 11 New Delhi 110075 India Amity Univ Dept Comp Sci & Engn Noida 201313 Uttar Pradesh India Univ Delhi Dept Comp Sci Delhi 110007 India Jaypee Inst Informat Technol Dept Comp Sci & Engn Noida 201309 Uttar Pradesh India

Software testing is a systematic process to identify the presence of errors in the developed software performed using test data. Manually generating test data is ineffective in terms of cost, time and code coverage. Past three decades automation of test data generation has been a research problem of interest and a wide range of work has been done to apply evolutionary meta-heuristics. Much work in past is devoted to apply evolutionary algorithms for data flow testing on procedural programs. Generating test cases of testing classes is more challenging. Presented work identifies these challenges and proposes a systematic data flow class testing based on 2-step heterogeneous process using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) evolutionary techniques. A prototype is systematically implemented and explained on an example class. A set of classes are further tested to study efficiency of the proposed work in terms of coverage percentage and execution time.

关键词： Test data Generation Automatic class testing data flow testing Evolutionary Algorithms

来源：评论

学校读者我要写书评

暂无评论

Test Case Selection for data flow Based Regression testing of BPEL Composite Services

Test Case Selection for Data Flow Based Regression Testing o...

引用

13th IEEE International Conference on Services Computing (SCC)

作者： Ji, Shunhui Li, Bixin Zhang, Pengcheng Hohai Univ Coll Comp & Informat Nanjing Jiangsu Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781509026289

BPEL(Business Process Execution Language) composite service evolves a lot in its lifetime. Regression testing must be performed to ensure the correctness of each evolved version. In this article, an approach is proposed to select test cases for regression testing based on data flow testing criterion. With XCFG(eXtended Control flow Graph) modeling BPEL composite service, the approach improves the traditional data flow analysis to compute the def-use pairs in BPEL process, and then identifies the affected def-use pairs by comparing the def-use pairs and XCFG model in the evolved version with those in the baseline version, where related WSDL(Web Service Description Language) documents are incorporated for comparison. The data flow paths covering the affected def-use pairs are calculated for regression testing, and some of them can reuse the test cases in the baseline version, which are determined by analyzing the path condition of data flow paths between two versions. The proposed approach can detect three kinds of changes, including process change, binding change and interface change. Experimental study shows the effectiveness.

关键词： Web composite service regression testing data flow testing test case selection

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM FOR THE DERIVATION OF CODEFINITIONS IN COMPUTER-PROGRAMS

引用

INFORMATION PROCESSING LETTERS 1986年第2期23卷 85-90页

作者： LASKI, J School of Engineering and Computer Science Oakland University Rochester MI 48063 U.S.A.

A codefinition is a set of definitions in the program that simultaneously reach an instruction in it. Codefinitions are used in data-based program testing. An intraprocedural iterative algorithm for the derivation of ... 详细信息

关键词： Program testing data flow testing liveness simple context full context definition-use chain codefinition

来源：评论

学校读者我要写书评

暂无评论

Test Case Selection for All-Uses Criterion-Based Regression testing of Composite Service

引用

IEEE ACCESS 2019年 7卷 174438-174464页

作者： Ji, Shunhui Li, Bixin Zhang, Pengcheng Hohai Univ Coll Comp & Informat Nanjing 211100 Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Peoples R China

Composite services evolve for various reasons. Test case selection in the regression testing is an effective technique to ensure the correctness of modified versions meanwhile to reduce the cost of testing. However, few work has studied the test case selection problem based on the data flow testing criteria. In addition, there are three observable kinds of changes during the evolution, including Process change, Binding change and Interface change, which all bring impact to the data flow. To address these issues, a test case selection approach is proposed for regression testing of BPEL (Business Process Execution Language) composite service where all-uses criterion is satisfied and all the three change types are involved. BPEL composite service is modeled with a two-level model in which XCFG (eXtended Control flow Graph) describes the behavior of BPEL process in the first level and WSDM (Web Service Description Model) depicts the interface information of composite service and partner services in the second level. Change impact analysis is performed to identify the affected definition-use pairs by comparing and analyzing two-level models of the baseline and evolved versions. And testing paths are generated to cover the affected definition-use pairs and select test cases based on the path condition analysis. Empirical result shows that the proposed approach is effective.

关键词： Regression testing data flow testing composite service test case selection

来源：评论

学校读者我要写书评

暂无评论

A Look at 25 Years of data

引用

IEEE SOFTWARE 2009年第1期26卷 15-17页

作者： Juristo, Natalia Moreno, Ana Vegas, Sira Shull, Forrest Univ Politecn Madrid E-28040 Madrid Spain

Is 25 years enough time to build up a coherent body of knowledge that can help point to useful principles? As a testbed for helping us answer this question, software testing techniques are a good place to start. Few software practices are as important as testing, and testing techniques are amenable to measurement and reasoning about their effectiveness. Because they're aimed at removing faults, measuring the number and type of such removed faults seems like a natural part of applying these techniques. To make sense of this data, Universidad Politecnica de Madrid researchers have spent some time worrying about how to put 25 years' worth of work together usefully.

关键词： Software testing data flow testing Control flow testing

来源：评论

学校读者我要写书评

暂无评论

PROVABLE IMPROVEMENTS ON BRANCH testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1993年第10期19卷 962-975页

作者： FRANKL, PG WEYUKER, EJ NYU COURANT INST MATH SCI DEPT COMP SCI NEW YORK NY 10012 USA AT&T BELL LABS SOFTWARE SYST RES CTR MURRAY HILL NJ 07974 USA

This paper compares the fault-detecting ability of several software test data adequacy criteria. It has previously been shown that if C1 properly covers C2, then C1 is guaranteed to be better at detecting faults than C2, in the following sense: a test suite selected by independent random selection of one test case from each subdomain induced by C1 is at least as likely to detect a fault as a test suite similarly selected using C2. In contrast, if C1 subsumes but does not properly cover C2, this is not necessarily the case. These results are used to compare a number of criteria, including several that have been proposed as stronger alternatives to branch testing. We compare the relative fault-detecting ability of data How testing, mutation testing, and the condition-coverage techniques, to branch testing, showing that most of the criteria examined are guaranteed to be better than branch testing according to two probabilistic measures. We also show that there are criteria that can sometimes be poorer at detecting faults than substantially less expensive criteria.

关键词： CONDITION-COVERAGE testing data flow testing FAULT DETECTION MUTATION testing PROGRAM testing SOFTWARE testing

来源：评论

学校读者我要写书评

暂无评论

testing web applications

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2006年第1期48卷 31-42页

作者： Mansour, N Houri, M Lebanese Amer Univ Div Math & Comp Sci Beirut 11208 Lebanon

Traditional testing techniques are not adequate for web-based applications, since they miss their additional features such as their multi-tier nature, hyperlink-based structure, and event-driven feature. Limited work has been done on testing web applications. In this paper, we propose new techniques for white box testing of web applications developed in the NET environment with emphasis on their event-driven feature. We extend recent work on modeling of web applications by enhancing previous dependence graphs and proposing an event-based dependence graph model. We apply data flow testing techniques to these dependence graphs and propose an event flow testing technique. Also, we present a few coverage testing approaches for web applications. Further, we propose mutation testing operators for evaluating the adequacy of web application tests. (c) 2005 Elsevier B.V. All rights reserved.

关键词： coverage testing data flow testing event flow testing dependence graphs mutation testing web applications

来源：评论

学校读者我要写书评

暂无评论

CT COVERAGE - INITIAL RESULTS

引用

SOFTWARE QUALITY JOURNAL 1993年第1期2卷 29-47页

作者： BENTLY, WG MILLER, EF MILES LABS INC ELKHART IN 46515 USA SOFTWARE RES INC SAN FRANCISCO CA 94107 USA

Software testing techniques based upon automated analysis of control flow are useful for improving software reliability. The fundamental types of control flow analysis, in ascending order of effectiveness, are statement, branch, and path coverage. Automated tools that perform branch coverage analysis are now accepted practice and researchers are exploring the area that exists between branch and path analysis. Path testing is complicated by the huge number of paths in ordinary programs and by anomalies, such as infeasible paths. The Ct testing strategy is a method for obtaining a manageable set of path classes by specifying a minimum iteration count k. The Ct test coverage metric is a measurement of the proportion of Ct path classes that are exercised within a program. This paper describes an initial experiment in which a special, automated tool was used to evaluate the Ct coverage of tests for a C program of significant size. The results of the study showed that high values of branch coverage may not necessarily imply high path coverage, that approximately 15% of the functions analysed were 'too complex' to analyse effectively, and that the majority of the remaining functions achieved on the order of 11% Ct k = 1 coverage. Experimental work in the attainment of high Ct coverage suggests the development of a new, more efficient software testing strategy, which combines Ct path and data flow analysis.

关键词： SOFTWARE testing PATH testing data flow testing PROGRAM ANALYSIS DEFECT DETECTION EVALUATION

来源：评论

学校读者我要写书评

暂无评论

An accelerating PSO algorithm based test data generator for data-flow dependencies using dominance concepts

引用

INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT 2017年第2期8卷 1534-1552页

作者： Kumar, Sumit Yadav, D. K. Khan, D. A. KIET Ghaziabad India NIT Jamshedpur Bihar India

One of the most important and effort intensive activity of the entire software development process is software testing. The effort involved chiefly increases because of the need to obtain optimal test data out of the entire search space of the problem under testing. Software test data generation is one area that has seen tremendous research in terms of automation and optimization. Generating or identifying an optimal test set that satisfies a more robust adequacy criteria, like data flow testing, is still a challenging task. A number of heuristic and meta-heuristics like GA, PSO have been applied to optimize the test data generation problem. GA, although more popular, has its own difficulties such as complex to implement and slow convergence rate. In this paper an accelerating particle swarm optimization algorithm (APSO) is applied to generate test data for data-flow dependencies of a program guided by a new fitness function. APSO is used because of its capability of balancing in exploration and exploitation. A new fitness function is designed based on the concepts of dominance relations, weighted branch distance for APSO to guide the search direction. A set of benchmark programs and four modules of Krishna Institute of Engineering and Technology ERP system were taken for the experimental analysis. The experimental results show that the proposed APSO based approach performed significantly better than random search, genetic algorithm and PSO in enhancing the convergence speed.

关键词： Search based software testing Evolutionary algorithms Particle swarm optimization data flow testing Dominance tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：