期刊文献+

基于符号执行和数据挖掘的路径可达性检测研究

Research on Path Feasibility Detection Based on Symbolic Execution and Data Mining
下载PDF
导出
摘要 要把静态分析技术真正应用于软件工程的实践中,程序中的不可到达路径依旧是一个巨大的障碍。在缺乏不可到达路径信息的情况下,数据流信息只能以一种非常保守的方式被利用,因而使进一步的工作,例如测试数据生成或者软件缺陷检测变得更加困难和低效。本文提出一种融合符号执行以及数据挖掘的混合型方法来检测程序中的不可到达路径,充分利用符号执行的精确性以及数据挖掘的高效性,这种方法被证明是有效并且实用的。 The presence of infeasible program paths remains a big obstacle in applying static analysis to software engineering activities.Without the knowledge of the infeasible path problem,data flow information can only be treated in a rather conservative way,which makes further works such as test data generation or bug finding much harder and more inefficient.This paper presents a hybrid approach,combining symbolic execution and data mining techniques for infeasible path detection.Taking advantages of the precise of symbolic execution and the efficiency of data mining,this approach proves to be effective and practical.
作者 范彧
出处 《计算机与现代化》 2013年第3期74-77,共4页 Computer and Modernization
基金 国家自然科学基金资助项目(60673120)
关键词 符号执行 数据挖掘 程序路径 可达性 不可到达路径 symbolic execution data mining program path feasibility infeasible path
  • 相关文献

参考文献16

  • 1Minh Ngoc Ngo, Hee Beng Kuan Tan. Heuristics-based infea- sible path detection for dynamic test data generation[J]. In-formation and Software Technology, 2008,50(7-8) :641-655.
  • 2Hedley D, Hennell M A. The causes and effects of infeasi- ble paths in computer programs [ C ]// Proceedings of the 8th International Conference on Software Engineering. 1985:259-266.
  • 3Coward P D. Symbolic execution and testing[J]. Informa- tion and Software Technology, 1991,33( 1 ) :53-64.
  • 4Goldberg Allen, Wang T C, Zimmerman David. Applica- tions of feasible path analysis to program testing[ C //Pro- ceedings of the 1994 ACM SIGSOFT International Symposi- um on Software Testing and Analysis. 1994:80-94.
  • 5Jasper Robert, Brennan Mike, Williamson Keith, et al. Test data generation and feasible path analysis [ C ]// Proceed- ings of the 1994 ACM SIGSOFF international Symposium on Software Testing and Analysis. 1994:95-107.
  • 6Zhang J, Wang X. A constraint solver and its application to path feasibility analysis[J]. Int'l J. of Software Engineering and Knowledge Engineering, 2001,11 (2) : 139-156.
  • 7Zhang J, Xu C, Wang X. Path-oriented test data genera- tion using symbolic execution and constraint solving tech- niques[ C]//Proceedings of the Second International Con- ference on Software Engineering and Formal Methods. 2004:242-250.
  • 8Rastislav Bodik, Rajiv Gupta, Mary kou Sofia. Refining data flow information using infeasible paths[C]// Proceedings of the 6th European Software Engineering Conference Held Joint- ly with the 5th ACM SIGSOFT International Symposium on Foundations of Software Engineering. 1997:361-377.
  • 9Chen T, Mitra T, Roychoudhury A, et al. Exploiting branch constraints without exhaustive path enumeration [ C ]// Proc. 5th International Workshop on Worst-Case Execution Time Analysis. 2005:40-43.
  • 10Bueno P M S, Jino M. Automatic test data generation for program paths using genetic algorithms [ C l// Proceedings of the 13th International Conference on Software Engineer- ing & Knowledge Engineering. 2001:2-9.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部