arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.08361cs.PL
收藏

Formulog:基于SMT的静态分析数据库(扩展版)

Formulog: Datalog for SMT-Based Static Analysis (Extended Version)

Aaron Bembenek, Michael Greenberg, Stephen Chong

摘要:

可满足性模理论(SMT)求解已经成为许多静态分析的关键部分,包括符号执行、精化类型检查和模型检验。我们提出Formulog,一个特定于域的语言,使它能够编写一系列的SMT为基础的静态分析的方式,既接近他们的正式规范,并服从高层次的优化和有效的评估。Formulog扩展了逻辑程序设计语言Datasheet的一阶函数语言和机制,用于表示和推理SMT公式;一个新颖的类型系统支持表达公式的构建,同时确保正常的评估和SMT解决都不会出错。我们的案例研究表明,一系列基于SMT的分析可以在Formulog中自然而简洁地编码,并且-由于这种编码-高级Datalog风格的优化可以自动并有利地应用于这些分析。

英文摘要:

Satisfiability modulo theories (SMT) solving has become a critical part of many static analyses, including symbolic execution, refinement type checking, and model checking. We propose Formulog, a domain-specific language that makes it possible to write a range of SMT-based static analyses in a way that is both close to their formal specifications and amenable to high-level optimizations and efficient evaluation. Formulog extends the logic programming language Datalog with a first-order functional language and mechanisms for representing and reasoning about SMT formulas; a novel type system supports the construction of expressive formulas, while ensuring that neither normal evaluation nor SMT solving goes wrong. Our case studies demonstrate that a range of SMT-based analyses can naturally and concisely be encoded in Formulog, and that -- thanks to this encoding -- high-level Datalog-style optimizations can be automatically and advantageously applied to these analyses.

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

↑