测试集自动生成方法中的可执行化研究  

TOWARDS EXECUTION IN AUTOMATIC TEST SUITE GENERATION

作　　者：赵邑新[1] 王建国[1] 吴建平[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机研究与发展》2001年第1期74-80,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金资助(69682002,69725003)

摘　　要：自动生成的测试集是可执行的才具有实用意义 .讨论了在测试集自动生成系统 TU GEN中实现的参数化可执行化算法 ,分析了该算法的效果、不足及其原因 ;讨论了可执行化处理中所涉及谓词可满足性问题的复杂度和测试路径可执行性问题 ,并在此基础上进一步提出并实现了“可执行参数化”的算法 ,克服了前一算法的不足 ,提高了 TU -GEN的实用性和执行效率 ;在进行了讨论分析后 ,以实例进行了对比和说明 。Only the executable test suite that is generated automatically has practical usage. In this paper, the algorithm of parametrization and executization implemented in the TUGEN system is discussed, and the result and the reason of its limitation are analyzed. Based on all the above work and studying the executability of the transition and the SAT problem of the predicate part, another algorithm called “executable parametrizing” is proposed and implemented to overcome the deficiency of the previous one and further improve the appliance of TUGEN. After analysis and comparison, the focus on the future research is outlined.

关 键 词：测试集自动生成 参数化 可执行化 算法复杂性 

分 类 号：TN915.04[电子电信—通信与信息系统]