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

AUTOMATIC TEST PATTERN GENERATION WITH branch testing

IEEE TRANSACTIONS ON COMPUTERS 1991年第6期40卷 785-791页

作者： MAKKI, RZ BOUGHAZALE, S TIANSHANG, C DUKE UNIV DEPT ELECT ENGNDURHAMNC 27706 HEILONGJIANG UNIV DEPT COMP SCIHARBINPEOPLES R CHINA

In this paper, we present a new test algorithm called branch testing for finite state machines. Based on branch testing, a new design for test (DFT) method is proposed. Comparison to other DFT methods shows the new method to be competitive relative to circuit overhead. A minimum set of paths containing all primary and internal gate-level input/output lines is found. Each of these paths is then sensitized so as to detect all single stuck-at faults.

关键词： branch testing DESIGN-FOR-TEST ONE-HOT ENCODING PATH SENSITIZATION SCAN PATH

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TEST DATA SELECTION AND QUALITY ESTIMATION BASED ON THE CONCEPT OF ESSENTIAL branchES FOR PATH testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第5期13卷 509-517页

作者： CHUSHO, T Systems Development Laboratory Hitachi Ltd.

A new coverage measure is proposed for efficient and effective software testing. The conventional coverage measure for branch testing has such defects as overestimation of software quality and redundant test data selection because all branches are treated equally. These problems can be avoided by paying attention to only those branches essential for path testing. That is, if one branch is executed whenever another particular branch is executed, the former branch is nonessential for path testing. This is because a path covering the latter branch also covers the former branch. branches other than such nonessential branches will be referred to as essential branches.

关键词： Test Data Selection Algorithm branch testing Control Flow Graph Coverage Measure Path testing Program testing Quality Estimation

来源：评论

学校读者我要写书评

暂无评论

An objective comparison of the cost effectiveness of three testing methods

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2007年第9-10期49卷 1045-1060页

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

branch testing is a well established method for exercising software. JJ-path testing, whilst employed by some practitioners, is less popular, and the testing of JJ-pairs finds few adherents. In this paper an objective, practical study of the cost-effectiveness of these three testing methods is reported. Tile effectiveness of each method is assessed, in tile presence of infeasible paths, not only oil its ability to cover the specific structural element of code that it targets, but also on its ability to cover the structural elements targeted by the other two methods - the collateral coverage it achieves. The assessment is based on the results derived from experiments in which each of tile three methods is applied to 35 units of program code. (c) 2006 Elsevier B.V. All rights reserved.

关键词： branch testing JJ-path testing JJ-pair testing white box testing collateral coverage cost-effectiveness structural testing

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC-GENERATION OF PATH COVERS BASED ON THE CONTROL FLOW-ANALYSIS OF COMPUTER-PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1994年第12期20卷 885-899页

作者： BERTOLINO, A MARRE, M UNIV PISA DIPARTIMENTO INFORMATI-56100 PISAITALY

branch testing a program involves: 1) generating a set of paths that will cover every arc in the program flowgraph, called a path cover;2) finding a set of program inputs that will execute every path in the path cover. The generation of path covers can be performed through the analysis of program control flow and can be automated, but, inevitably, statically generated path covers may include infeasible paths. The method used for path generation should attempt to reduce the incidence of this problem. The paper presents a generalized algorithm that finds a path cover for a given program flowgraph. The analysis is conducted on a reduced flowgraph, called a ddgraph, and uses graph theoretic principles differently than previous approaches. In particular, the relations of dominance and implication which form two trees of the arcs of the ddgraph are exploited. These relations make it possible to identify immediately a subset of ddgraph arcs, called unconstrained arcs, having the property that a set of paths exercising all the unconstrained arcs will also cover all the arcs in the ddgraph. In fact, the algorithm has been designed to cover all the unconstrained arcs of a given ddgraph: the paths are derived one at a time, each path covering at least one as yet uncovered unconstrained arc. The greatest merits of the algorithm are its simplicity and its flexibility. It consists in just visiting recursively in combination the dominator and the implied trees and is flexible in the sense that it can derive a path cover to satisfy different requirements, according to the strategy adopted for the selection of the unconstrained arc to be covered at each recursive iteration. This feature of the algoritm can be employed to address the problem of infeasible paths, by adopting the most suitable selection strategy for the problem at hand. Embedding of the algorithm into a software analysis and testing tool is recommended.

关键词： AUTOMATED testing TOOL branch testing DDGRAPH DOMINATOR TREE IMPLIED TREE INFEASIBLE PATH PATH COVER UNCONSTRAINED ARC

来源：评论

学校读者我要写书评

暂无评论

New Algorithms and Methods to Estimate Maximum-Likelihood Phylogenies: Assessing the Performance of PhyML 3.0

引用

SYSTEMATIC BIOLOGY 2010年第3期59卷 307-321页

作者： Guindon, Stephane Dufayard, Jean-Francois Lefort, Vincent Anisimova, Maria Hordijk, Wim Gascuel, Olivier Univ Montpellier CNRS LIRMM F-34392 Montpellier 5 France Univ Auckland Dept Stat Auckland 1142 New Zealand ETH Inst Computat Sci CH-8092 Zurich Switzerland Swiss Inst Bioinformat CH-1015 Lausanne Switzerland Univ Oxford Dept Stat Oxford OX1 3TG England

PhyML is a phylogeny software based on the maximum-likelihood principle. Early PhyML versions used a fast algorithm performing nearest neighbor interchanges to improve a reasonable starting tree topology. Since the original publication (Guindon S., Gascuel O. 2003. A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (> 2500 citations in ISI Web of Science) because of its simplicity and a fair compromise between accuracy and speed. In the meantime, research around PhyML has continued, and this article describes the new algorithms and methods implemented in the program. First, we introduce a new algorithm to search the tree space with user-defined intensity using subtree pruning and regrafting topological moves. The parsimony criterion is used here to filter out the least promising topology modifications with respect to the likelihood function. The analysis of a large collection of real nucleotide and amino acid data sets of various sizes demonstrates the good performance of this method. Second, we describe a new test to assess the support of the data for internal branches of a phylogeny. This approach extends the recently proposed approximate likelihood-ratio test and relies on a nonparametric, Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments sheds light on the links between this new approach and the more classical nonparametric bootstrap method. Overall, our tests show that the last version (3.0) of PhyML is fast, accurate, stable, and ready to use. A Web server and binary files are available from http://***/phyml/.

关键词： Bootstrap analysis branch testing LRT and aLRT maximum likelihood NNI phylogenetic software SPR tree search algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploiting Hardware Advances for Software testing and Debugging (NIER Track) 11

Exploiting Hardware Advances for Software Testing and Debugg...

引用

33rd International Conference on Software Engineering (ICSE)

作者： Soffa, Mary Lou Walcott, Kristen R. Mars, Jason Univ Virginia Charlottesville VA 22903 USA

ISBN: (纸本)9781450304450

Despite the emerging ubiquity of hardware monitoring mechanisms and prior research work in other fields, the applicability and usefulness of hardware monitoring mechanisms have not been fully scrutinized for software engineering. In this work, we identify several recently developed hardware mechanisms that lend themselves well to structural test coverage analysis and automated fault localization and explore their potential. We discuss key factors impacting the applicability of hardware monitoring mechanism for these software engineering tasks, present novel online analyses leveraging these mechanisms, and provide preliminary results demonstrating the promise of this emerging hardware.

关键词： branch testing fault localization performance monitoring

来源：评论

学校读者我要写书评

暂无评论

Generating test data for branch coverage 15

Generating test data for branch coverage

引用

15th IEEE International Conference on Automated Software Engineering (ASE 2000)

作者： Gupta, N Mathur, AP Soffa, ML Univ Arizona Dept Comp Sci Tucson AZ 85721 USA

ISBN: (纸本)0769507107

branch coverage is an important criteria used during the structural testing of programs. In this paper, we present a new program execution based approach to generate input data that exercises a selected branch in a program. The test data generation is initiated with an arbitrarily chosen input from the input domain of the program. A new input is derived from the initial input in an attempt to force execution through any of the paths through the selected branch. The method dynamically switches among the paths that reach the branch by refining the input. Using a numerical iterative technique that attempts to generate an input to exercise the branch, it dynamically selects a path that offers less resistance. We have implemented the technique and present experimental results of its performance for some programs. Our results show that our method is feasible and practical.

关键词： path testing branch testing iterative relaxation technique testing tools

来源：评论

学校读者我要写书评

暂无评论

Generating Test Data for branch Coverage 00

Generating Test Data for Branch Coverage

引用

Proceedings of the 15th IEEE international conference on Automated software engineering

作者： Mary Lou Soffa Aditya P. Mathur Neelam Gupta

ISBN: (纸本)9780769507101

branch coverage is an important criteria used during the structural testing of programs. In this paper, we present a new program execution based approach to generate input data that exercises a selected branch in a program. The test data generation is initiated with an arbitrarily chosen input from the input domain of the program. A new input is derived from the initial in-put in an attempt to force execution through any of the paths through the selected branch. The method dynamically switches among the paths that reach the branch by refining the input. Using a numerical iterative technique that attempts to generate an input to exercise the branch, it dynamically selects a path that offers less resistance. We have implemented the technique and present experimental results of its performance for some programs. Our results show that our method is feasible and practical.

关键词： branch testing testing tools -Path testing iterative relaxation technique

来源：评论

学校读者我要写书评

暂无评论

Towards Combining Functional Requirements Tests and Unit Tests as a Preventive Practice Against Software Defects

Towards Combining Functional Requirements Tests and Unit Tes...

引用

IEEE International Conference on Intelligent Computer Communication and Processing

作者： Raluca Dudila Ioan Alfred Letia Department of Computer Science Technical University of Cluj-Napoca

ISBN: (纸本)9781479914920

During the last decade, software testing has gained increased popularity and awareness. Despite this fact, major companies around the world have already started to eliminate the process of software testing as a singular activity and have included it within the other steps of the software life-cycle. By adhering to this tendency, this article concentrates on exploring two existing white box and black box testing techniques together with a method by which they can be combined and applied during code creation in order to minimize the debugging effort at a later point in time. An open source software program written in .NET was chosen for demonstrating the proposed gray-box method and a small analysis on the use-case coverage was made.

关键词： White Box branch testing Black Box Equivalence Class Partitioning Defect Prevention

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：