首页> 外文会议>Fifth International Conference on Computer and Information Technology(CIT 2005) >AICTO: An Improved Algorithm for Planning Inter-class Test Order
【24h】

AICTO: An Improved Algorithm for Planning Inter-class Test Order

机译:AICTO:用于计划类间测试订单的改进算法

获取原文
获取原文并翻译 | 示例

摘要

Determining inter-class test order is one of the most difficult tasks in cluster level testing. This paper proposes the concept of weighted object relation diagram (WORD) by extending the traditional object relation diagram (ORD). When generating the inter-class test order based on WORD, minimizing the number of realistic stubs (not the number of classes to be stubbed) is regarded as optimization objective. Some heuristic rules, such as association intensity, cycling weight and direction factors of edges, are used as important criteria to cut association edges to break cycles. An improved algorithm AICTO is presented via analyzing some principles of the existing methods and overcoming some of their drawbacks. This algorithm has some merits such as the fewer number of classes to be stubbed, holding the association edges with higher RD and excellent stability. In practice, the algorithm AICTO has been applied to our C/C++ program testing prototype CppTest and produces favorable effects.
机译:确定类间测试顺序是集群级测试中最困难的任务之一。通过扩展传统对象关系图(ORD),提出了加权对象关系图(WORD)的概念。当基于WORD生成类间测试顺序时,将实际存根的数量(而不是要存根的类的数量)最小化被视为优化目标。一些启发式规则(例如关联强度,循环权重和边缘的方向因子)被用作重要的标准,以剪切关联边缘以破坏循环。通过分析现有方法的一些原理并克服它们的一些缺点,提出了一种改进的算法AICTO。该算法具有一些优点,例如待分类的类数较少,具有较高的RD和出色的稳定性的关联边。实际上,算法AICTO已应用于我们的C / C ++程序测试原型CppTest,并产生了良好的效果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号