A Survey of Symbolic Execution Techniques

DOI Web Site 被引用文献4件

抄録

<jats:p>Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. For instance, a tool for identifying software vulnerabilities may need to rule out the existence of any backdoor to bypass a program’s authentication. One approach would be to test the program using different, possibly random inputs. As the backdoor may only be hit for very specific program workloads, automated exploration of the space of possible inputs is of the essence. Symbolic execution provides an elegant solution to the problem, by systematically exploring many possible execution paths at the same time without necessarily requiring concrete inputs. Rather than taking on fully specified input values, the technique abstractly represents them as symbols, resorting to constraint solvers to construct actual instances that would cause property violations. Symbolic execution has been incubated in dozens of tools developed over the past four decades, leading to major practical breakthroughs in a number of prominent software reliability applications. The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience.</jats:p>

収録刊行物

  • ACM Computing Surveys

    ACM Computing Surveys 51 (3), 1-39, 2018-05-23

    Association for Computing Machinery (ACM)

被引用文献 (4)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ