计算机工程 ›› 2008, Vol. 34 ›› Issue (24): 241-243.doi: 10.3969/j.issn.1000-3428.2008.24.084

• 工程应用技术与实现 • 上一篇    下一篇

相容类加权的扩展相容性扫描树构造算法

肖剑锋1,尤志强2,邝继顺1   

  1. (1. 湖南大学计算机与通信学院,长沙 410082;2. 湖南大学软件学院,长沙 410082)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-12-20 发布日期:2008-12-20

Extended Compatibility Scan Tree Construction Algorithm Based on Compatible Clique with Weight

XIAO Jian-feng1, YOU Zhi-qiang2, KUANG Ji-shun1   

  1. (1. School of Computer and Communication, Hunan University, Changsha 410082; 2. School of Software, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-12-20 Published:2008-12-20

摘要: 针对基于相容类加权的扩展相容性扫描树构造算法在生成相容类时存在的问题,对其进行3个方面的改进:选取包含X的扫描单元,选取度更小的扫描单元生成异或类,异或类再进行异或生成新的异或类。实验结果表明,该改进算法是有效的。

关键词: 全扫描测试, 扫描树, 测试应用时间, 测试数据量

Abstract: In terms of the problems in extended compatibility scan tree construction algorithm based on weighted compatible clique when creating compatible clique, three improvements of this algorithm are proposed by following rules: to select the scan cells which have more Xs in its test vector, to select the scan cells which have smaller degree to create XOR clique, and to allow an XOR clique to create other new XOR clique. Experimental results show this improved algorithm is more effective.

Key words: full-scan test, scan tree, test application time, test data volume

中图分类号: