期刊文献+

基于指针映射集的动态内存故障测试方法研究 被引量:9

Research on Dynamic Memory Faults Testing Method Based on Pointer Mapping Sets
下载PDF
导出
摘要 动态内存故障在使用指针的程序中是普遍存在的,采用动态测试方法进行测试难以准确定位故障源.而现有的静态分析方法主要存在漏报和误报过多的情况.针对这些问题,提出了指针映射代数系统的概念,全面地反映了指针与内存之间的映射关系,并给出了面向不同故障的指针映射集的构造规则,以此为基础建立了动态内存故障模型.通过指针映射集和故障模型,可以自动检测内存释放异常、内存泄露和空指针引用等动态内存故障,提高了测试效率.在分析过程中,还综合应用了控制流图和路径条件,提高了测试结果的精度.实验结果表明,该方法能够有效检测动态内存故障,而且由于规则定义较为全面,漏报和误报率也较低. Dynamic memory faults are ubiquitous in the program with pointers. It is difficult to locate faults sources adopting dynamic testing method. Static analysis methods nowadays often miss some faults and produce too many false alarms. Considering of these problems, this paper puts forward the notion of pointer mapping algebra system that reflects the mapping relationship of pointer and memory completely, and gives the construction rules of pointer mapping sets for different faults class, and then establishes dynamic memory faults model. Through pointer mapping sets and fault model, it can detect bad deallocation, memory leak and null pointer dereference faults automatically and increase the testing efficiency. In the process of analyzing, it adopts synthetically control flow chart and path condition in order to increase the precision of testing results. Results of experimentation show that this method can detect dynamic memory faults effectively. Since rule definition is general, the probability of missing faults and producing false alarms is lower.
出处 《计算机学报》 EI CSCD 北大核心 2009年第11期2274-2281,共8页 Chinese Journal of Computers
基金 国家"八六三"高技术研究发展计划探索导向类项目基金(2007AA010302 2009AA012404)资助
关键词 软件测试 静态分析 指针映射集 内存泄漏 空指针引用 software testing static analysis pointer mapping sets memory leak null pointerdereference
  • 相关文献

参考文献1

二级参考文献11

  • 1[1]Chen T Y,Lau M F. A new heuristic for test suite reduction.Information and Software Technology, 1998, 40(5/6) : 347~354
  • 2[2]Chen T Y, Lau M F. A simulation study on some heuristics for test suite reduction. Information and Software Technology,1998, 40(13): 777~787
  • 3[3]Lee J G, Chung C G. An optimal representative set selection method. Information and Software Technology, 2000, 42 (1):17~25
  • 4[4]Chen T Y,Lau M F. Dividing strategies for the optimization of a test suite. Information Processing Letters, 1996, 60(3): 135~141
  • 5[5]Johnson D S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 1974, 9(3): 256~278
  • 6[6]Harrold M J,Gupta R,Soffa M L. A methodology for controlling the size of a test suite. ACM Transactions on Software Engineering and Methodology, 1993, 2(3): 270~285
  • 7[7]Chen T Y,Lau M F. Heuristics towards the optimization of the size of a test suite. In: Proceedings of the 3rd International Conference on Software Quality Management, Seville, Espagne, 1995, 2:415~424
  • 8[8]Jones J A, Harrold M J. Test-suite reduction and prioritization for modified condition/decision coverage. In: Proceedings of ICSM'01, Florence, Italy, 2001, 11:92~102
  • 9[9]Wong W E, Horgan J R, London S et al. Effect of test set minimization on fault detection effectiveness. In: Proceeding of the 17th International Conference on Software Engineering, Seattle, Washington DC, 1995. 41~50
  • 10[10]Wong W E, Horgan J R,Mathur A P et al. Test set size minimization and fault detection effectiveness: A case study in a space application. In: Proceeding of the 21st Annual International Computer Software and Application Conference of COMPSAC 97, Washington DC, 1997. 522~528

共引文献56

同被引文献72

引证文献9

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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