针对面向对象软件类级测试中方法序列调用时的Oracle问题,提出了一种基于代数规格的面向对象蜕变关系构造方法,并根据此方法进行蜕变测试。首先基于代数规格给出面向对象测试中蜕变关系的构造准则,然后根据构造准则对GFT(Generating a F...针对面向对象软件类级测试中方法序列调用时的Oracle问题,提出了一种基于代数规格的面向对象蜕变关系构造方法,并根据此方法进行蜕变测试。首先基于代数规格给出面向对象测试中蜕变关系的构造准则,然后根据构造准则对GFT(Generating a Finite number of Test cases)算法中范式构造蜕变关系方法进行改进,最后通过一个整数栈类对提出的蜕变关系构造准则进行了验证测试,并与GFT算法中范式构造蜕变关系方法进行了对比,结果表明在相似的变异检测率下,改进后的方法使得构造的蜕变关系冗余度降低了66%,验证了改进的蜕变关系构造方法有更低的蜕变关系冗余度,提高了软件测试效率。展开更多
This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator wh...This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can bedefined by strategy relations and transformations are given in order to model theprocess of finding the solution of a problem. Also discussed is its object-orientedimplementation. The functional specification and the design specification for an algorithm are given in one framework so that the correctness of the algorithm can beeasily proved.展开更多
文摘针对面向对象软件类级测试中方法序列调用时的Oracle问题,提出了一种基于代数规格的面向对象蜕变关系构造方法,并根据此方法进行蜕变测试。首先基于代数规格给出面向对象测试中蜕变关系的构造准则,然后根据构造准则对GFT(Generating a Finite number of Test cases)算法中范式构造蜕变关系方法进行改进,最后通过一个整数栈类对提出的蜕变关系构造准则进行了验证测试,并与GFT算法中范式构造蜕变关系方法进行了对比,结果表明在相似的变异检测率下,改进后的方法使得构造的蜕变关系冗余度降低了66%,验证了改进的蜕变关系构造方法有更低的蜕变关系冗余度,提高了软件测试效率。
文摘This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can bedefined by strategy relations and transformations are given in order to model theprocess of finding the solution of a problem. Also discussed is its object-orientedimplementation. The functional specification and the design specification for an algorithm are given in one framework so that the correctness of the algorithm can beeasily proved.
