声明式程序分析中的通用可扩展性(基于选择的组合剪枝)
Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)
AI总结:
本文提出利用Datalog引擎中的choice构造对关系投影基数进行自适应剪枝,以近乎通用的方式提升声明式程序分析的可扩展性,并在Doop和Gigahorse框架上实现超过20倍的性能提升。
摘要:
在本文中,我们针对该问题提出了一种简单、统一且优雅的解决方案,具有惊人的实际效果,并且几乎适用于任何基于Datalog的分析。该方法利用现代Datalog引擎(如Soufflé)原生支持的choice构造。choice构造允许在关系中定义函数依赖,过去已被用于表达工作列表算法。我们展示了一种近乎通用的构造,使choice构造能够灵活地限制谓词的求值。该技术几乎适用于任何可想象的分析架构,因为当关系的(由程序员控制的)投影超过期望的基数时,它会自适应地剪枝求值结果。我们将该技术应用于现存规模最大的Datalog分析框架:Doop(用于Java字节码)和Gigahorse框架(用于以太坊智能合约)的主要客户端分析。在无需理解现有分析逻辑且仅需最小的局部修改的情况下,每个框架的性能都显著提升,对于最困难的输入提升超过20倍,而完整性的牺牲几乎可以忽略不计。
英文摘要:
In this work, we present a simple, uniform, and elegant solution to the problem, with stunning practical effectiveness and application to virtually any Datalog-based analysis. The approach consists of leveraging the choice construct, supported natively in modern Datalog engines like Soufflé. The choice construct allows the definition of functional dependencies in a relation and has been used in the past for expressing worklist algorithms. We show a near-universal construction that allows the choice construct to flexibly limit evaluation of predicates. The technique is applicable to practically any analysis architecture imaginable, since it adaptively prunes evaluation results when a (programmer-controlled) projection of a relation exceeds a desired cardinality. We apply the technique to probably the largest, pre-existing Datalog analysis frameworks in existence: Doop (for Java bytecode) and the main client analyses from the Gigahorse framework (for Ethereum smart contracts). Without needing to understand the existing analysis logic and with minimal, local-only changes, the performance of each framework increases dramatically, by over 20x for the hardest inputs, with near-negligible sacrifice in completeness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。