An Improved Pointer Analysis Based on Constraint Logic Programming
Dynamic symbolic execution is the vital technique in the security analysis of program, and it is widely used in the domain of test case generation, malware analysis, vulnerability exploration and so on. There are several problems in the process of dynamic symbolic execution, such as symbolic address, system call, path selection. In order to explore the aliasing problem due to the symbol address analysis, we propose an improved pointer analysis based on constraint Logic Programming. Intraprocedural pointer-to analysis and specific constraints are used to improve the precise of pointer analysis. The results of experiment show that this method can analysis C programs correctly and the execution time is reduced.
constraint solving Static Single Assignment Pointer-to analysis Test data generation
Xi Guo Huanguo Zhang Bo Zhao Jing Li Fan He
School of Computer,Wuhan University,Wuhan 430072,Hubei,China Key Laboratory of Aerospace Information School of Computer Science and Technology,Wuhan University of Technology,1040 Heping Road,Wuhan 4300
国际会议
太原
英文
265-268
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）