期刊文献+

改进动态符号执行中的非线性约束求解过程 被引量:2

Improving the Solving of Non-linear Arithmetic Constraints in Dynamic Symbolic Execution
下载PDF
导出
摘要 动态符号执行用程序变量的具体值替换动态数据结构及复杂表达式中的符号变量以便简化路径条件.这种简化路径条件的方法虽然简单,但不精确,会导致路径条件无法约束求解或者求解结果不正确.为此,提出一种改进动态符号执行中非线性算术约束求解过程的方法.该方法利用连续求解的路径条件约束具有相似性这一特征,在进行非线性算术约束求解时充分利用上次约束求解的输出信息.它用具体值依次试探替换符号变量;若所有符号变量都被试探替换而仍未求解成功,则枚举涉及非线性算术约束的变量的取值情况,将非线性算术约束转化为线性算术约束并进行求解.实验结果表明,与传统的动态符号执行工具相比,本文方法对非线性算术约束具有更快的求解速度. Dynamic symbolic execution replaces the symbolic variables in dynamic data structures and complex expressions with con- crete values to simplify the path condition. Such simplification is simple, yet not accurate. It may lead to the failure or the wrong so- lution of solving path constraints. Therefore, the paper proposes an approach to improve the process of non-linear arithmetic con- straints in dynamic symbolic execution. By exploiting the similarity between the path constraints to solve in succession, the proposed approach makes the best of the last solution when solving the current non-linear arithmetic path constraint. It tries to replace the sym- bolic variables with concrete values successively; if all the tries fail to obtain the solution, then the values of variables in non-linear a- rithmetic constraints are enumerated to convert the non-linear arithmetic constraints to linear arithmetic constraints. Experimental re- sults show that the proposed approach solves non-linear arithmetic constraints faster, compared to the traditional dynamic symbolic ex- ecution tool.
出处 《小型微型计算机系统》 CSCD 北大核心 2014年第11期2396-2401,共6页 Journal of Chinese Computer Systems
基金 安徽省自然科学基金项目(11040606M131)资助 国家自然科学基金项目(91118007)资助
关键词 软件测试 动态符号执行 非线性算术约束 约束相似性 software testing dynamic symbolic execution non-linear arithmetic constraint similarity of constraint
  • 相关文献

参考文献14

  • 1Godefroid P, Klarlund N, Sen K. DART: directed automated ran- dom testing [ J]. ACM Sigplan Notices ,2005,40(6) :213-223.
  • 2Sen K, Marinov D, Agha G. CUTE:a concolic unit testing engine for C [ C]. Proceedings of the 10th European Software Engineering Conference Held Jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, New York, USA,2005 : 263 -272.
  • 3Cadar C, Ganesh V, Pawlowski P M, et al. EXE: automatically gen- erating inputs of death [ J]. ACM Transactions on Information and Systems Security ,2008,12 (2) : 1-38.
  • 4Bumim J,Sen IC Heuristics for scalable dynamic test generation [ C]. Proceedings of the 23rd IEEE/ACM International Conference on Auto- mated Software Engineering,Washington,USA,2008:443-446.
  • 5Tillmann N, Halleux J. Pex-white box test generation for . NET[ C ]. Beckert B, H~ihnle R. Tests and Proofs, Berlin: Springer, 2008 : 134-153.
  • 6Fuhs C, G-iesl J, Middeldorp A,et al. SAT solving for termination analysis with polynomial interpretations [C]. Marques-Silva J, Sakallah K A. Theory and Applications of Satisfiability Testing- SAT 2007, Berlin: Springer,2007 : 340-354.
  • 7De Moura L, Bjemer N. Z3: an efficient SMT solver [C]. Ra- makrishnan C R, Rehof J. Tools and Algorithms for the Construc- tion and Analysis of Systems, Berlin: Springer,2008 : 337-340.
  • 8Fuhs C, Navarro-Marset R, Otto C, et al. Search techniques for ra- tional polynomial orders [C]. Antexier S, Campbell J, Rubio J, Sorge V, Suzuki M, Wiedijk F. Intelligent Computer Mathemat- ics, Berlin: Springer,2008 : 109-124.
  • 9Borralleras C, Lucas S, Oliveras A, et al. SAT modulo linear arith- metic for solving polynomial constraints [ J]. Journal of Automated Reasoning, 2012,48 ( 1 ) : 107-131.
  • 10King J C. Symbolic execution and program testing [ J]. Communi- cations of the ACM, 1976,19(7) : 385-394.

同被引文献9

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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