Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of University of Electronic Science and Technology of China》 2007-S3
Add to Favorite Get Latest Update

A New Method for Test Suite Reduction Based on κ-Coloring Problem

SUN Ji-rong1,2,LI Zhi-shu1,WU Jiang3,NI Jian-cheng1,LI Bao-lin1 (1. School of Computer Science, Sichuan University Chengdu 610065; 2. Teaching Affairs Department, Sichuan Radio and TV University Chengdu 610073; 3. Imformation Management Center, Sichuan University Chengdu 610065)  
Test suite reduction technique based on I/O relationship can keep the fault detection capability with combinations of all input parameters. Although the size of a reduced test suite generated by greedy algorithm is within a logarithmic factor of the optimal, the main weaknesses of greedy algorithm are its time and space requirement for construction. To address this issue, coloring problem is introduced to reduce the problem space (I,O): the parameter in same color is allocated to an equivalent class, and the parameters in each I/O relation are substituted accordingly to obtain a reduced problem space( I ', O') . Then ( I ', O') can be easily solved to construct Tr ed' by greedy algorithm. At last, each test case in Tr ed' is extend to ensure all the parameter in same color and e valuated to the same value, thus Tr ed' can be transformed efficiently to Tred for (I,O).
【Fund】: 国家中小企业创新基金(06C26225101730);; 四川省重点科技项目(05GG021-003-2)
【CateGory Index】: TP311.52
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved