Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)
Abstract
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\'e. 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.
Cite
@article{arxiv.2503.05945,
title = {Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)},
author = {Anastasios Antoniadis and Ilias Tsatiris and Nevill Grech and Yannis Smaragdakis},
journal= {arXiv preprint arXiv:2503.05945},
year = {2025}
}