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

您当前的位置：

首页 >

文章列表页 >

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

信息工程 | 更新时间：2023-11-28

- 启发式学习自动化程序指令的可达性测试
- Automatic Statement Reachability Testing Using Heuristics Algorithm
- 工程科学与技术 2007年39卷第4期页码：146-150
- 作者机构：
- 作者简介：
- 基金信息：
  
  四川省重点科技攻关资助项目(05GG021);国家科技型中小企业技术创新基金资助项目(06C26225101730)
- DOI：
  中图分类号：
- 纸质出版日期：2007，
扫描看全文
金虎,李志蜀,陈良银.启发式学习自动化程序指令的可达性测试[J].工程科学与技术,2007,39(4):146-150.

Automatic Statement Reachability Testing Using Heuristics Algorithm[J]. Advanced Engineering Sciences, 2007,39(4):146-150.
金虎,李志蜀,陈良银.启发式学习自动化程序指令的可达性测试[J].工程科学与技术,2007,39(4):146-150. DOI：

Automatic Statement Reachability Testing Using Heuristics Algorithm[J]. Advanced Engineering Sciences, 2007,39(4):146-150. DOI：

摘要

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

Abstract

Abstract: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.

关键词

自动化软件测试约束满足问题前向检测启发式学习

Keywords

automatic software testingconstraint satisfaction problemsforward checkingheuristic study

references

Memon A,Pollack M,Soffa M.Using a goal-driven approach to generate test cases for GUIs[C]//Proceedings Int Conf on Software Engineering.Los Angeles,CA,1999.

Nguyen Tran Sy,Yves Deville.Automatic test data generation for programs with integer and float variables[C] //16th IEEE International Conference on Automated Software Engineering(ASE01).2001.

Gotlieb A,Botella G,Rueher M.Automatic test data generation using constraint solving techniques[C]//International Symposium on Software Testing and Analysis,1998,23(2):53-62.

Guesgen H W,Philpott A.Heuristics for solving fuzzy constraint satisfaction problems[C] //Proceedings of the 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems.1995:132-135.

Frost D,Dechter R.In Search of the Best Constraint Satisfaction Search[C] //Proceedings of the 12th AAAI.USA:AAAI Press,1994:301-306.

Nadel B A.Constraint satisfaction algorithms[J].Computational Intelligence,1990,5(4):188-224.

Harvey W D,Ginsberg M L.Limited Discrepancy Search[C] //Proceedings of the 4th International Conference on Artificial Intelligence.Morgan Kaufmann.1995:607-615.

Jorgensen P C.Software testing:a craftsman\'s approach[M].2nd Ed.CRC Press,2000.

Bacchus F,Grove A.On the forward checking algorithm[C] //Proceedings the 1st International Conference on Principle and Practice of Constraint Programming.1995:293-309.

Gupta N,Mathur A P,Soffa M L.Automated test data generation using an iterative relaxation method[C] //ACM SIGSOFT 6th International Symposium on Foundations of Software Engineering(FSE-6).Orlando,Florida,1998:231-244.

更多指标>

浏览量

下载量

CNKI被引量

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据