构件软件的测试问题综述

基于构件的软件设计方法是软件设计的新趋势。文章介绍了构件及构件软件的概念、特点和由此引发的测试问题,介绍了现有的构件软件的测试方法和测试工具的研究情况。     

测试性试验中样本集的测试覆盖充分性研究

测试性试验结果的准确性不仅与样本量有关,还与试验中能够激活的测试数量有关.在建立故障模式测试模型的基础上,提出了样本集的测试覆盖充分性度量和准则.给出了模型中要素的确定方法,以及该度量和准则的应用流程.最后通过实例应用说明了测试覆盖充分性度量和准则的可行性.     

样本集充分性度量数据建模与软件设计

分析了充分性度量的基本数据类型,建立了数据关联模型。模型详细描述了故障模式、功能、结构单元和测试项目等数据之间的复杂关联关系。在此基础上开发了样本集充分性度量软件,给出了软件的功能和数据库结构设计,阐述了充分性度量的算法流程。通过案例应用验证了算法的正确性,同时表明该软件可大大提高工作效率。     

基于测试充分性准则的教育软件内容测试

教育软件内容测试是对教育软件根本性目标进行测试的需要,也是教育信息技术和教育软件工程研究的重点内容之一。基于测试充分性准则提出了教育软件内容测试,通过测试充分性准则来指导确定测试数据集,保障遵循学习特征的教育软件所包含的教育思想内容的正确性测试。     

软件构件测试

研究软件构件测试技术,介绍自定义构件的开发。结合传统的软件测试技术,针对构件技术新特性在测试中引发的问题,从定义内置测试的测试点开始,提出了一种内置测试框架(Built-In Test Framework,BITF),最后给出了构件内置测试过程,并利用内置测试方法对设计的GIS构件进行了测试。     

常用的基于控制流的测试充分性准则

本文介绍了几种在软件测试中常用的基于控制流的测试充分性评价准则。这些测试充分性准则适用于用过程式语言、面向对象语言编写的程序。测试人员可用这些准则判断究竟测试了多少代码,还有多少代码未测试到。     

面向测试的构件系统模型及测试用例生成方法

随着面向构件的软件开发方法的广泛应用,构件系统的描述和测试成为保证软件质量的关键所在。由于构件系统的复杂性和开发方法的特殊性,用传统方法对构件系统进行集成测试往往面对很多困难。提出了一种改进的面向测试的构件描述模型,称为TCSM,它着重对构件系统中的构件间的交互和约束进行了动态描述,为构件系统集成测试阶段的功能测试和边界测试等提供了大量可用信息。在此基础上,进一步提出一种把TCSM转换成测试模型的方法,以UML协作图模型为原型,实现了构件系统从描述模型到测试模型的自动转换。最后,实现了一种在所产生的测试模型上自动生成测试用例的算法。TCSM更好地描述了构件的交互行为信息,进一步实现了系统的自动化测试,减少了通常需要在构件系统搭建完成后,针对测试对系统手工建立测试模型的工作,提高了构件系统开发的效率和可靠性。     

一种基于模型的测试充分性评估方法

测试充分性评估通常采用覆盖率的方法来评估测试对软件特征的覆盖充分程度。如今,传统的充分性评估方法难以满足复杂软件的测试评估需求。首先,代码覆盖准则难以准确验证软件需求;其次,软件测试还需考虑软件不同特征对系统测试充分性的不同影响。对此,提出一种基于接口的建模方法和基于该模型的综合覆盖充分性评估方法。该方法根据软件接口说明,对系统功能进行特征抽取、建模,并对接口模型的测试用例进行不同层级的充分性评估,对评佑结果进行归一化处理,得到系统的综合测试充分性。通过案例表明,这种评佑方法能够反映功能的测试充分性,对测试用例的设计和优化有一定指导意义。     

软件构件内置测试技术研究

本文在构件可测试性研究的基础上,提出一种在构件内部建立测试点,扩展构件内部测试接口,安装测试引擎进行测试的构件内置测试模型,并详细介绍了该模型各个部分的功能及实现.     

软件可靠性测试充分性研究

在阐述了软件测试充分性的定义和软件测试充分性准则的定义、分类和作用的基础上，形式化分析了软件正确性测试充分性和软件可靠性测试充分性的目的和实质，重点研究了软件可靠性测试的充分性，将软件可靠性测试充分性准则分为软件可靠性增长测试充分性准则和软件可靠性验证测试充分性准则，给出将测试充分性准则用于可靠性测试流程的模型。     

基于路径引导的回归测试用例集扩增方法

为了全面测试演化软件,回归测试通常需要生成新的测试用例。concolic测试是一种沿着具体执行路径进行符号执行的软件验证技术,通过生成测试数据来执行程序的所有可行路径。回归测试中,由于concolic测试关注于程序本身,没有利用已有测试用例和软件演化信息,导致生成大量无效测试数据,浪费资源和时间。为解决此问题,提出一种基于路径引导的回归测试用例集扩增方法。该方法将目标路径作为引导,根据软件演化信息选择有利于覆盖目标路径的测试用例,利用已有测试用例跳过重叠初始子路径,对后续目标子路径进行concolic测试并生成覆盖目标路径的测试数据。案例分析表明,本文方法相比传统concolic测试,本方法在覆盖程序可行路径的同时,可有效减少concolic测试路径,提高测试数据生成效率。     

测试用例集约简问题研究及其进展

测试用例集约简问题是软件测试中的关键问题之一,其目的是使用尽可能少的测试用例充分满足给定的测试目标,从而提高测试效率、降低测试成本。在简要介绍了测试用例集约简问题基本概念的基础上,总结了求解该问题的几种主要方法,分析比较了这些方法的效率和特性。随后探讨了与测试用例集约简问题强相关的测试用例集错误检测效率的问题,并研究了测试用例优先级技术。最后指出了测试用例集约简问题的下一步研究方向。     

回归测试中测试用例集优化方法的研究

回归测试是软件演化过程中频繁进行的且开销巨大的一项任务,测试用例集的优化程度直接影响着测试的成本和效率。针对回归测试过程的特点,提出一种对测试用例集优化的新方法,即通过对测试用例集进行必要的消除冗余和调整排序,完成了对初始测试用例集的精简以及执行顺序的确定过程,使得有限的测试资源得到科学合理的分配。实验结果表明,相对于以往的测试用例集优化方法,新方法的效率和资源分配的合理性均有了显著的提高。     

Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation

Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considered as a single-objective optimisation problem. However, real world regression testing can be a complex process in which multiple testing criteria and constraints are involved. This paper presents the concept of Pareto efficiency for the test suite minimisation problem. The Pareto-efficient approach is inherently capable of dealing with multiple objectives, providing the decision maker with a group of solutions that are not dominated by each other. The paper illustrates the benefits of Pareto efficient multi-objective test suite minimisation with empirical studies of two and three objective formulations, in which multiple objectives such as coverage and past fault-detection history are considered. The paper utilises a hybrid, multi-objective genetic algorithm that combines the efficient approximation of the greedy approach with the capability of population based genetic algorithm to produce higher-quality Pareto fronts.     

基于蚁群算法的测试用例集优化方法

为了达到以尽可能少的测试用例满足测试需求的目的,提出了一种先对测试用例集进行完全划分,再利用蚁群算法对其优化的方法。首先根据测试需求间的相互关系,将最初的测试用例集划分成多个互不相交的子集,每个子集中的元素为等价测试用例;其次从各个子集中选取一个测试用例,组成一个新的集合,该集合已经摒弃了部分冗余测试用例;然后利用蚁群算法对测试用例集进行最优的简化;最后通过实例证明了该方法可以产生比原有的方法更优的测试用例集。     

Fault-based test suite prioritization for specification-based testing

Context

Existing test suite prioritization techniques usually rely on code coverage information or historical execution data that serve as indicators for estimating the fault-detecting ability of test cases. Such indicators are primarily empirical in nature and not theoretically driven; hence, they do not necessarily provide sound estimates. Also, these techniques are not applicable when the source code is not available or when the software is tested for the first time.

Objective

We propose and develop the novel notion of fault-based prioritization of test cases which directly utilizes the theoretical knowledge of their fault-detecting ability and the relationships among the test cases and the faults in the prescribed fault model, based on which the test cases are generated.

Method

We demonstrate our approach of fault-based prioritization by applying it to the testing of the implementation of logical expressions against their specifications. We then validate our proposal by an empirical study that evaluates the effectiveness of prioritization techniques using two different metrics.

Results

A theoretically guided fault-based prioritization technique generally outperforms other techniques under study, as assessed by two different metrics. Our empirical results also show that the technique helps to reveal all target faults by executing only about 72% of the prioritized test suite, thereby reducing the effort required in testing.

Conclusions

The fault-based prioritization approach is not only applicable to the instance empirically validated in this paper, but should also be adaptable to other fault-based testing strategies. We also envisage new research directions to be opened up by our work.     

基于用户会话的Web测试集简化方法

随着用户会话的增多,基于用户会话的Web测试方法的测试集会越来越庞大,为了解决测试开销受到挑战的问题,使用概念分析方法对测试用例分簇,构建层次概念网络,结合贪心算法,提出了3种Web应用程序测试集的简化方法,扩展了测试集的动态简化,并且提出了移除过时用户会话的测试集动态简化方法.最后,实验结果表明了该方法在语句覆盖和故障检测方面的有效性.     

Empirical studies of test‐suite reduction

Test‐suite reduction techniques attempt to reduce the costs of saving and reusing test cases during software maintenance by eliminating redundant test cases from test suites. A potential drawback of these techniques is that reducing the size of a test suite might reduce its ability to reveal faults in the software. Previous studies have suggested that test‐suite reduction techniques can reduce test‐suite size without significantly reducing the fault‐detection capabilities of test suites. These studies, however, involved particular programs and types of test suites, and to begin to generalize their results, further work is needed. This paper reports on the design and execution of additional studies, examining the costs and benefits of test‐suite reduction, and the factors that influence these costs and benefits. In contrast to previous studies, results of these studies reveal that the fault‐detection capabilities of test suites can be severely compromised by test‐suite reduction. Copyright © 2002 John Wiley & Sons, Ltd.     

Fully automated interoperability test suite derivation for communication protocols

We propose an automatic test derivation method for testing interoperability of communication protocols. It first derives a skeleton test suite for control part through a sort of reachability analysis. Next, it parameterizes each test case. Finally, it completes the test suite by actualizing test cases by assigning values to their parameters. By constructing test case space based on stable states and by basing test case actualization step on orthogonal arrays used in experimental design techniques, state space explosion is avoided. In order to demonstrate the feasibility and effectiveness, out method is applied to the ATM/B-ISDN signaling protocol and TCP. The application results show that our method surpasses the conventional methods in terms of both test size and coverage.     

Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm

ContextSoftware has become an innovative solution nowadays for many applications and methods in science and engineering. Ensuring the quality and correctness of software is challenging because each program has different configurations and input domains. To ensure the quality of software, all possible configurations and input combinations need to be evaluated against their expected outputs. However, this exhaustive test is impractical because of time and resource constraints due to the large domain of input and configurations. Thus, different sampling techniques have been used to sample these input domains and configurations.ObjectiveCombinatorial testing can be used to effectively detect faults in software-under-test. This technique uses combinatorial optimization concepts to systematically minimize the number of test cases by considering the combinations of inputs. This paper proposes a new strategy to generate combinatorial test suite by using Cuckoo Search concepts.MethodCuckoo Search is used in the design and implementation of a strategy to construct optimized combinatorial sets. The strategy consists of different algorithms for construction. These algorithms are combined to serve the Cuckoo Search.ResultsThe efficiency and performance of the new technique were proven through different experiment sets. The effectiveness of the strategy is assessed by applying the generated test suites on a real-world case study for the purpose of functional testing.ConclusionResults show that the generated test suites can detect faults effectively. In addition, the strategy also opens a new direction for the application of Cuckoo Search in the context of software engineering.