arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.10235cs.SE
收藏

索引运算符扩展符号执行的范围

Indexing Operators to Extend the Reach of Symbolic Execution

Earl T. Barr, David Clark, Mark Harman, Alexandru Marginean

摘要:

传统的程序分析分析一种程序语言,即所有可以用该语言编写的程序。然而,在所有可能编写的程序和用一种语言编写的实际程序的语料库之间存在差异。我们试图利用这种差异:对于一个给定的程序,我们应用一个定制的程序转换Indexify转换表达式,目前SMT求解器不,一般来说,处理,如字符串上的约束,到equisatisfiable表达式,他们处理。为此,Indexify将难以处理的表达式中的运算符替换为在原始运算符域的有限子集上表现相同的同态版本,并返回表示该子集之外的未知数的底部。通过关注什么文字和表达式对分析给定程序最有用,Indexify构建了一个小的有限理论,扩展了求解器对目标程序构建的表达式的能力。Indexify的定制性质必然意味着其评估必须是实验性的,依赖于其在实践中的有效性。我们开发了Indexif},一个用于Indexify的工具。我们通过将其应用于两个真实世界的基准测试-coreutils中的字符串表达式和fdlibm 53中的浮点数来证明其实用性和有效性。Indexify将coreutils的完成时间从Klee的平均49.5米缩短到6.0米。它增加了coreutils上的分支覆盖率从Klee的30.10%和Zesti的14.79%增加到66.83%。当在fdlibm 53中索引浮动时,Indexifyl将分支覆盖率从Klee的34.45%增加到71.56%。对于一个受限的输入类,Indexify允许符号执行以前的技术无法到达的程序路径:它覆盖的分支是Klee的两倍多。

英文摘要:

Traditional program analysis analyses a program language, that is, all programs that can be written in the language. There is a difference, however, between all possible programs that can be written and the corpus of actual programs written in a language. We seek to exploit this difference: for a given program, we apply a bespoke program transformation Indexify to convert expressions that current SMT solvers do not, in general, handle, such as constraints on strings, into equisatisfiable expressions that they do handle. To this end, Indexify replaces operators in hard-to-handle expressions with homomorphic versions that behave the same on a finite subset of the domain of the original operator, and return bottom denoting unknown outside of that subset. By focusing on what literals and expressions are most useful for analysing a given program, Indexify constructs a small, finite theory that extends the power of a solver on the expressions a target program builds. Indexify's bespoke nature necessarily means that its evaluation must be experimental, resting on a demonstration of its effectiveness in practice. We have developed Indexif}, a tool for Indexify. We demonstrate its utility and effectiveness by applying it to two real world benchmarks --- string expressions in coreutils and floats in fdlibm53. Indexify reduces time-to-completion on coreutils from Klee's 49.5m on average to 6.0m. It increases branch coverage on coreutils from 30.10% for Klee and 14.79% for Zesti to 66.83%. When indexifying floats in fdlibm53, Indexifyl increases branch coverage from 34.45% to 71.56% over Klee. For a restricted class of inputs, Indexify permits the symbolic execution of program paths unreachable with previous techniques: it covers more than twice as many branches in coreutils as Klee.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑