测试用例集的优化技术分析与改进

测试用例集优化技术是软件测试的重要组成部分,对回归测试检测效率影响巨大.针对给定的测试目标,获得精简的测试需求集和测试用例序列集,有助于提高测试用例集优化的效率和效果.首先介绍了测试用例集约简问题的基本概念,对现有的各种约简方法进行分析比较,接着讨论了测试用例的优先级排序问题,最后提出将测试用例约简技术和优先级技术结合起来,提高用例检错效率和缩小用例空间的优化策略,文章还引入等价类和快速排序思想,动态调整测试用例序列,并通过实验证明该改进是行之有效的.     

基于迭代预测降低巧合正确性测试用例影响的软件错误定位方法

巧合正确性测试用例是指某个测试用例虽然在执行程序时覆盖了错误的代码行,但是其测试结果依然是正确的.在测试用例集中,巧合正确性测试用例是普遍存在的.巧合正确性测试用例对基于程序谱的软件错误定位方法的错误定位精度产生很大的影响.为了避免这一影响,本文提出一种基于迭代预测降低巧合正确性测试用例影响的方法.该方法的基本思想是通过迭代的方法,预测巧合正确性测试用例的数目N,再对候选测试用例的巧合正确性可疑值进行排序,去掉可疑值较高的前v个巧合正确性测试用例,利用新的测试集进行错误定位,直到找到错误语句,或者候选的巧合正确性测试用例的个数小于迭代预测值N为止.使用Siemens Suite测试用例集对系统进行了测试,测试结果表明该方法能够有效提高基于程序谱的软件错误定位方法的错误定位精度.     

怀疑度计算公式受偶然正确性影响理论分析

软件错误定位效率可能受诸多因素影响,如测试用例优先级排序、测试用例构成、测试用例覆盖率及偶然正确性测试用例等.主要关注偶然正确性对怀疑度计算公式错误定位效率的影响.为此,提出一个基于函数单调性的理论分析框架来证明30个经典怀疑度计算公式受偶然正确性影响的程度.偶然正确性对怀疑度计算公式影响是有益的理论探索.     

面向C/S结构的软件自动化测试工具的设计

以软件的回归自动化测试为研究重点,设计了一个专门应用于CLIENT/SERVER型软件的回归自动化测试工具.该工具的测试引擎统一调度测试用例,测试用例具体实施方案上采用关键字驱动脚本技术,实现了一个脚本调用多个测试用例.同时该工具主要使用B-shell语言实现,使该系统能够在多个平台上运行.     

黑盒测试用例设计方法研究

为了快速地设计出完整有效的测试用例以保障软件测试质量,在分析黑盒测试用例设计技术的基础上,采用了将边界值和等价类测试技术结合起来设计测试用例的一种新的方法思路。在此以一个三角形问题为实例通过分析,先用边界值分析确定数据边界,再用等价类划分方法得到等价的数据类,从而快速获得了一个完整有效的测试用例。采用这种方法设计的测试用例具有较强的发现软件程序错误的的特点,不但能有效避免测试的盲目性,并且能提高测试效率和测试覆盖度。     

面向错误定位的基于分支聚类的测试用例选择方法

已有的面向错误定位的测试用例选择方法大多数仅考虑了测试用例的语句覆盖信息,不能为错误定位选择合适的测试用例,从而导致不能有效提高错误定位的准确性。针对这一问题,提出了一种新的测试用例选择方法。文中方法分析了测试用例的执行路径信息,根据测试用例动态执行时的分支特征,采用分支聚类方法对测试用例进行选择。实验表明,提出的方法可以有效减少测试用例数量,降低错误定位的复杂度,并提高错误定位的准确性。     

基于组合模型的高效黑盒测试用例设计

测试用例的选择和生成技术是软件测试尤其是黑盒测试中一个重要研究领域.测试用例的质量将影响软件测试的科学性和有效性.组合模型是一种应用十分广泛的软件黑盒测试模型,在一般测试用例选择方法基础上,结合典型应用提出了一种基于组合模型的高效黑盒测试用例设计方法.该方法产生的测试用例具有数量少,能实现组合模型中参数间最大限度组合的特点,从而提高软件测试质量的同时.降低成本,提高效率.     

基于三元闭包理论的软件回归测试影响域分析方法

为提高测试充分性,减少系统维护的代价,提出了一种基于三元闭包理论的软件回归测试影响域分析方法。将软件系统抽象为一个社交网络,软件系统提供的功能抽象为虚拟人,为虚拟人之间定义交流通道类型,通过图论和三元闭包理论构建非直接发生联系的人的关系,给出回归建议。建立有向有权图模型,再结合三元闭包理论,利用算法计算每个测试项推荐系数,如果推荐系数大于0.5,则将该测试项纳入回归测试。该算法实现了测试用例集约简的同时,结合测试项社区网络针对性地将可能有缺陷的测试用例进行回归测试,满足网络频率规划管理软件等项目工程回归测试的应用需求,大大降低了人力成本,提高了回归测试效率。     

基于UML的面向对象软件回归测试研究

研究了UML图及事物间的关系,提出了基于UML的面向对象软件回归测试技术,它能有效地控制测试范围和缩减测试用例,帮助软件测试人员在不增加测试风险的情况下选择合适的测试用例和减少测试量,提高软件回归测试的有效性和降低软件测试成本.     

Silk Test在数据驱动技术中的应用

简述自动化回归测试工具SilkTest的主要特点及工作原理,提出一种提高回归测试自动化程度的技术,即采用数据驱动方式,使测试脚本成为可以驱动所有类似测试用例组的通用脚本,同时实现了测试执行和测试逻辑的分离,使得测试用例的修改和维护更加容易.此外,还介绍了SilkTest在数据驱动技术中的应用,简化了测试过程,提高了测试效率.     

Multi-objective test case prioritization based on multi-population cooperative particle swarm optimization

Test case prioritization (TCP) technique is an efficient approach to improve regression testing activities. With the continuous improvement of industrial testing requirements, traditional single-objective TCP is limited greatly, and multi-objective test case prioritization (MOTCP) technique becomes one of the hot topics in the field of software testing in recent years. Considering the problems of traditional genetic algorithm (GA) and swarm intelligence algorithm in solving MOTCP problems, such as falling into local optimum quickly and weak stability of the algorithm, a MOTCP algorithm based on multi-population cooperative particle swarm optimization (MPPSO) was proposed in this paper. Empirical studies were conducted to study the influence of iteration times on the proposed MOTCP algorithm, and compare the performances of MOTCP based on single-population particle swarm optimization (PSO) and MOTCP based on non-dominated sorting genetic algorithm II (NSGA-II) with the MOTCP algorithm proposed in this paper. The results of experiments show that the test case prioritization algorithm based on MPPSO has stronger global optimization ability, is not easy to fall into local optimum, and can solve the MOTCP problem better than test case prioritization algorithm based on the single-population PSO and NSGA-II.     

探索式测试在雷达软件中的应用研究

雷达软件测试中常会遇到测试周期短、软件文档滞后甚至缺失等问题。在这种情况下,由于探索式测试方法强调了测试设计和执行的同时性,并弱化了对软件文档的要求,因而能够发挥灵活、快速的优势。文中针对探索式测试和传统脚本测试的优缺点,将会话机制和漫游方法等探索式测试成功实践与经典的脚本式测试流程结合,提出了脚本会话测试模型。通过复用对应类型雷达软件测试历史项目的测试设计,在经典软件测试流程中引入会话机制和漫游方法,并充分利用资深测试人员的经验和组织资产,降低软件需求、设计文档以及测试人员经验和能力对测试的影响,增强测试的适应性,提高测试的效率和质量。     

Iterative Antirandom Testing

Antirandom testing is a variation of pure random testing, which is the process of generating random patterns and applying it to a system under test (both software systems and hardware systems). However, research studies have shown that pure random testing is relatively less effective at fault detection than other testing techniques. Antirandom testing improves the fault-detection capability of random testing by employing the location information of previously executed test cases. In antirandom testing we select test case such that it is as different as possible from all the previous executed test cases. Unfortunately, this method essentially requires enumeration of the input space and computation of each input pattern when used on an arbitrary set of existing test data. This avoids scale-up to large test sets and (or) long input vectors. The objective of this paper is to find a more efficient method of the test generation which does not need any computation. The key idea of proposed approach is an iterative application of the short antirandom tests where the first test vector in each iteration is generated randomly. Moreover, we propose a new metric the Maximal Minimal Hamming Distance (MMHD) which allows us to define an optimal antirandom test with restricted number of patterns. Experimental results are given to evaluate the performance of the new approach.     

Probabilistic testing of OSI protocols

Protocols are large and complex software systems. Complete conformance testing of an implementation against its standard may not be feasible in terms of the resources available. This paper discusses a new approach, the P-method, to the testing of meaningful subsets of communication protocols for an asynchronous model of communication. The approach is based on the probabilistic verification of protocols, which is carried out on the more probable part of the protocol first. The technique can be used for generating probabilistic test sequences for the conformance testing of communication protocols to standards. The proposed method yields meaningful protocol test sequences which test the most probable behaviors of a protocol when the testing of the complete protocol is not feasible. Probabilistic test sequences can be categorized into different classes. The higher the class a probabilistic test sequence is in, the larger the extent of the protocol it covers, and the better is the fault coverage. If the class of a test sequence is high enough, its fault coverage is comparable to the fault coverage of test sequences generated by other methods. Results from a study of the P-method, using alternating bit protocol (ABP) and a subset of NBS TP4 as examples, support the claims above. It can also be shown that if errors are introduced only to the more probable part of the protocol, the fault coverage of P-method is also comparable to other methods     

基于MC/DC准则的确认测试用例生成方法

形式化的需求规格说明以其能够被自动操纵的形式,精确地描述了软件预期提供的功能,为测试提供了良好的条件。运用模型检查技术自动生成测试用例是形式化方法在基于需求的测试中采用的主要途径。MC/DC(修改的条件/判定覆盖)准则是一种实用的软件结构覆盖率测试准则。结合模型检查技术,提出一种从形式化的软件需求中自动生成测试用例的方法,以达到对软件需求的类似于MC/DC准则的覆盖测试。以一个实际的案例为例,并检验其生成的用例对代码的覆盖率,证明方法的实用性。     

错误模式和程序切片的软件漏洞检测

提出了结合错误模式和切片技术的软件漏洞检测方法。错误模式库主要由软件的历史错误模式和一些常见的错误模式组成。然后将函数的入口参数作为前置条件,将建立好的错误模式作为后置条件,求得满足前置条件和后置条件的基于规约的切片,即可得到一条可能潜在漏洞的可疑路径。在得到这些可疑路径集合之后,使用符号执行和约束求解技术来进行可疑路径的验证,并自动产生可以触发该漏洞的测试例输入。该方法可以快速地进行漏洞可能产生的区域定位,并能自动产生触发漏洞的输入。     

Efficient object-oriented integration and regression testing

This paper presents a model, a strategy and a methodology for planning integration and regression testing from an object-oriented model. It shows how to produce a model of structural system test dependencies which evolves with the refinement process of the object-oriented design. The model (test dependency graph) serves as a basis for ordering classes and methods to be tested for regression and integration purposes (minimization of test stubs). The mapping from unified modeling language to the defined model is detailed as well as the test methodology. While the complexity of optimal stub minimization is exponential with the size of the model, an algorithm is given that: computes a strategy for integration testing with a quadratic complexity in the worst case; and provides an efficient testing order for minimizing the number of stubs. Various integration strategies are compared with the optimized algorithm (a real-world case study illustrates this comparison). The results of the experiment seem to give nearly optimal stubs with a low cost despite the exponential complexity of getting optimal stubs. As being a part of a design-for-testability approach, the presented methodology also leads to the early repartition of testing resources during system integration for reducing integration duration     

A HW/SW Co-Verification Technique for FPGA Test

Field programmable gate arrays （FPGAs） have wide and extensive applications in many areas. Due to programmable feature of FPGAs, faults of FPGAs can be easily tolerated if fault sites can be located. A hardware/software （HW/SW） co-verification technique for FPGA test is proposed in this paper. Taking advantage of flexibility and observability of software in conjunction with high-speed simulation of hardware, this technique is capable of testing each input/output block （IOB） and configurable logic block （CLB） of FPGA automatically, exhaustively and repeatedly. Fault cells of FPGA can be positioned automatically by the proposed approach. As a result, test efficiency and reliability can be enhanced without manual work.