A Constraint-Pattern Based Method for Reachability Determination.
COMPSAC, pp. 85-90, 2017.
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...更多
下载 PDF 全文 (上传PDF)