A Constraint-Pattern Based Method for Reachability Determination.

COMPSAC, pp. 85-90, 2017.

被引用1|浏览7
EI

摘要

When analyzing programs using static program analysis, we need to determine the reachability of each possible execution path of the programs. Many static analysis tools collect constraints of each path and use SMT solvers to determine the satisfiability of these constraints. The accumulated computing time can be long if we use SMT solvers...更多

代码

数据

ZH
24小时获取PDF
引用
您的评分 :
0

 

标签
评论