启发式学习自动化程序指令的可达性测试

为了测试程序指令的可达性，需要搜索可触发包含该指令的控制流路径执行的测试用例。该问题可等价为路径约束满足问题的自动求解，求解结果即为验证指令可达的测试用例。为了提高自动求解的性能，在前向检测算法基础上改进设计了R_BinSearchFC算法，算法结合了边界测试数据选取和二叉树搜索技术，可有效提高对数据空间的搜索速度，并可扩展到在实数域空间的求解搜索。实验结果表明，采用了启发式学习的R_BinSearch算法可自动生成有效的测试用例，完成对指令的可达性测试。

Automatic Statement Reachability Testing Using Heuristics Algorithm

To test the reachability of the program statements, it is necessary to find out test cases that can result in corresponding control flow path execution. It is equivalent to the resolving of Path Constraint-Satisfaction-Problems, and the resolution is the test cases that can meet the reachability-testing requirement. Based on Forward Checking Algorithm, R_BinSearchFC algorithm was proposed for better searching performance. Boundary test data selecting technique and binary tree searching method were employed in the algorithm for real type data set computation and the resolution time could be efficiently reduced. Experiment results showed good effect for automatic testing statement reachability.