一种有效的约简测试用例的方法

软件测试是软件开发过程中的一个重要组成部分,是贯穿整个软件开发生命周期、对软件产品(包括阶段性产品)进行验证和确认的活动过程;测试用例的质量和数量将直接决定软件测试的科学性和有效性,测试用例约简算法是在满足测试需求的前提下生成较少的测试用例;文章先对测试需求做了初步简化,然后在剩下的测试需求基础上进行划分,从而得到约简后的测试用例集;结果表明,对于有较多测试需求的系统,此方法有助于快速有效地生成规模较小的测试用例。     

探究关于测试需求集的测试用例集极小化方法

软件测试是软件生产厂商在软件开发过程中非常重要的一个阶段。本文围绕着测试用例集约简技术展开研究。首先阐述了测试用例集的约简技术的含义与作用,分析了测试用例集的约简技术能够降低软件测试成本以及提高软件测试效率的方法。本文结合几种常用的测试用例集的约简技术,提出一种关于测试需求集的测试用例集极小化方法,该方法基于测试需求集的最小测试用例集的形成算法,从而得到优化的代表测试用例集,为测试用例集约简技术提供很好的理论基础和测试技术的依据。     

基于变异分析的测试用例约简方法

针对回归测试过程中由于测试需求的变更导致测试用例规模不断扩大、测试成本不断增加的问题,提出一种基于变异分析的测试用例约简方法（RTM）。首先,以测试用例能否检测到指定变异体为依据,对测试用例进行划分并创建二进制数值形式的变异体事务集矩阵;然后,应用改进的关联挖掘算法获取测试用例间的关联关系;最后,根据这些关联关系有效约简测试用例。6个经典程序仿真实验结果表明,RTM能够使约简后的测试用例约简率达到37%,与传统贪心算法和启发式算法相比,测试用例约简率提高了6%,且在提高测试用例约简率的同时,保证了测试覆盖率,单个测试用例的测试覆盖率平均提高了11%。所提方法能够利用尽可能少的测试用例满足更多的测试需求,有效提高了测试效率,降低了测试成本。     

基于DBSCAN算法的测试用例优化方法

在软件测试研究领域,测试用例约简一直以来都是研究的重点,目前的一些研究利用测试需求之间复杂的相互关系得到约简的测试需求集,在此基础上可以优化对应的测试用例集,但单个测试需求所对应的测试用例集可能是一个密度分布且数量较大的集合.对单个测试需求所对应的测试用例集合进行合理优化约简,本文在这个方面做了深入的研究和探索,提出了两种基于黑盒测试的类等价划分和类边界值分析策略.基于DBSCAN算法提出了科学合理的参数取值方法,提高了算法的适应问题程度和效率,结合优化的算法和两种策略从而得到优化约简的测试用例集.     

改进型程序切片方法的测试需求约简技术研究

传统的测试用例集约简技术大多采用由测试需求集直接生成测试用例集的方法.该方法虽然能够约简测试用例集,但出现测试需求冗余,约简后的测试用例集不够精准等问题.针对这些问题,提出了一种基于六元结构表的程序切片方法.利用程序切片精简测试代码,省去构造程序依赖图的复杂步骤;根据代码间的相互关系和模块间的耦合度,利用启发式算法约简测试需求;在约简后的测试需求上,精简测试用例集.将该方法应用到当前主流的Android平台上比较约简前后G,GRE的用例集.实验结果表明:约简后的测试需求集能够在获得较少的测试用例集的前提下保证较高的覆盖率.     

蚁群模拟退火算法在测试用例约简中的应用

参数的成对组合覆盖测试技术是软件测试中有效的测试方法之一。该文将模拟退火思想引入蚁群算法,组成新的混合算法,即蚁群模拟退火混合算法(ASA),应用在组合测试用例的约简过程中。按照测试的特殊需求进行多种建模尝试,通过仿真实验对算法涉及的参数进行研究,实验验证了ASA 算法对测试用例集的约简作用是有效的。     

测试用例集的约简方法研究

蚁群算法是一种群体智能算法,能有效解决复杂的组合优化问题.在测试用例约简的问题上,该算法能在速度和精确度上寻求到一个平衡点.与传统的最小化算法不同,这个算法不仅考虑了每个测试用例覆盖度,还考虑了用例的运行代价,实验给出了这个算法与经典算法的比较结果,结论表明,此算法能快速有效缩减测试用例集的数量并降低测试运行代价,以提...     

基于关联模式的回归测试用例约简模型

针对回归测试过程中测试需求不断变更造成的测试用例数量大、测试效率低等问题,提出一种基于关联模式的回归测试用例约简模型。该模型对模块、测试需求及测试用例三者间的关联性进行纵向分析,对测试需求间的关联关系进行横向分析并约简测试需求,进而生成并约简测试用例,实现对修改后的软件进行有效的回归测试。     

一种基于测试需求约简的测试用例集优化方法

测试用例集优化的目标是用尽可能少的测试用例充分满足给定的测试目标.针对给定的测试目标,获得精简的测试需求集有助于提高测试用例集优化的效率和效果.从测试需求约简的角度考虑测试用例集优化,首先给出可以精确描述测试需求间相互关系的测试需求约简模型;基于此模型,提出一种测试需求约简方法,可以获得精简测试需求集,作为测试用例集生成和约简的基础,从而实现测试用例集优化.实验结果表明,测试需求约简有助于获得规模较小的测试用例集,实现系统、科学、有效的测试.     

基于多优化目标的软件测试用例约简方法研究

软件测试是软件工程的一个重要组成部分,其目标是能够及时发现软件中的错误,确保软件高质量。测试用例是软件测试的基础,覆盖度较高且精简的测试用例集可以提高测试效率和降低成本。软件测试覆盖标准较多,一个好的测试用例评价指标也存在多种,为了能够在约简测试用例集规模的同时获取较高的测试能力,本文提出了一种基于多优化目标的测试用例集约简算法,该算法旨在根据测试用例需求,构建多优化目标的测试用例模型,使用该模型获取一个最优解的测试用例子集,使用最小化用例集方法最小化测试用例,迭代执行直到测试用例集覆盖所有的测试需求,实验结果表明该算法可以约简测试用例集,获取较高的综合测试效果。     

基于弱变异准则的测试用例约简方法

针对为数较多的测试用例增加了回归测试成本的问题，提出一种基于弱变异准则的测试用例约简方法。首先，基于弱变异准则获得测试用例和变异分支关系矩阵；然后，重复约简4种无效测试需求和子集测试用例；最后，结合人工鱼群算法选择当前最优测试用例，并且交替执行简化和测试用例选择操作直至覆盖所有测试需求。该方法针对6个经典程序与贪心算法和HGS算法相比，基于弱变异准则并且不改变或稍微改变变异评分的条件下，约简率分别提高了73.4%和8.2%，且耗时分别降低了25.3%和56.1%。实验结果表明，所提方法在回归测试中可有效约简测试用例，降低测试代价。     

A probabilistic alternative to regression suites

Automated regression suites are essential in developing large applications, while maintaining reasonable quality and timetables. The main argument against the automation of regression suites, in addition to the cost of creation and maintenance, is the observation that if you run the same test many times, it becomes increasingly less likely to find bugs. To alleviate such problems, a new regression suite practice, using random test generators to create regression suites on-the-fly, is becoming more common. In this practice, instead of maintaining tests, we generate test suites on-the-fly by choosing several specifications and generating a number of tests from each specification.     

Exhaustive property oriented model-based testing with symbolic finite state machines

We advocate a fusion of property-oriented testing (POT) and model-based testing (MBT). The existence of a symbolic finite state machine (SFSM) model fulfilling the properties of interest is exploited for property-directed test data generation and to create a test oracle. A new test generation strategy is presented for verifying that the system under test (SUT) satisfies the same LTL safety conditions over a given set of atomic propositions as the model. We prove that this strategy is exhaustive in the sense that any SUT violating at least one of these formulae will fail at least one test case of the generated suite. It is shown that the existence of a model allows for significantly smaller exhaustive test suites as would be necessary for POT without reference models. As a corollary, the main theorem also generalises a known result about SFSM-based conformance testing for language equivalence. Our approach fits well to industrial development processes for (potentially safety-critical) cyber-physical systems, where both models and properties representing system requirements are elaborated for development, verification, and validation.     

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.     

基于冗余测试用例的最小测试用例集生成方法

提出一种最小测试用例集的生成方法。保留在某个测试标准下冗余,但在其他测试标准下不冗余的测试用例,即在测试用例集简化期间通过有选择性地保留测试用例来生成一个测试用例集。与已有方法相比,该方法能在不影响测试组大小范围的情况下有效提高错误检测效率。     

Generating semantically valid test inputs using constrained input grammars

ContextGenerating test cases based on software input interface is a black-box testing technique that can be made more effective by using structured input models such as input grammars. Automatically generating grammar-based test inputs may lead to structurally valid but semantically invalid inputs that may be rejected in early semantic error checking phases of a system under test.ObjectiveThis paper aims to introduce a method for specifying a grammar-based input model with the model’s semantic constraints to be used in the generation of positive test inputs. It is also important that the method can generate effective test suites based on appropriate grammar-based coverage criteria.MethodFormal specification of both input structure and input semantics provides the opportunity to use model instantiation techniques to create model instances that satisfy all specified constraints. The input interface of a subject system can be specified using a high-level specification scheme such as attribute grammars, and a transformation function from this scheme to an instantiable formal modeling language can generate the desired model instances.ResultsWe propose a declarative grammar-based input specification method that is based on a variation of attribute grammars and allows the user to specify input constraints in addition to input structure. The model can be instantiated automatically to generate structurally and semantically valid test inputs. The proposed method has the capability to specify test requirements and coverage criteria and use them to generate valid test suites that satisfy test coverage criteria requirements.ConclusionThe work presented in this paper provides a black-box test generation method for grammar-based software inputs that can automatically generate criteria-covering test suites.     

一种最小测试用例集生成方法

测试用例的数量和质量决定软件测试的成本和有效性．该文提出了一种生成最小测试用例集的方法，该方法首先充分考虑测试目标中各个测试需求之间的相互关系，将满足测试需求的所有可用测试用例进行划分，根据划分的结果生成一个测试用例集，然后利用启发式算法、贪心算法或整数规划方法来消除冗余，对这个测试用例集进行进一步的简化．这种方法与已有方法相比，优点在于它可以生成满足所有测试需求的最小测试用例集．     

Standardization and testing of implementations of mathematical functions in floating point numbers

Requirements definition and test suites development for implementations of mathematical functions in floating point arithmetic in the framework of the IEEE 754 standard are considered. A method based on this standard is proposed for defining requirements for such functions. This method can be used for the standardization of implementations of such functions; this kind of standardization extends IEEE 754. A method for designing test suites for the verification of those requirements is presented. The proposed methods are based on specific properties of the representation of floating point numbers and on some features of the functions under examination.