Static Analysis Under Non-Deterministic Program Assumptions
Abstract
Static analyses overwhelmingly trade precision for soundness and automation. For this reason, their use-cases are restricted to situations where imprecision isn't prohibitive. In this paper, we propose and specify a static analysis that accepts user-supplied program assumptions that are local to program locations. Such assumptions can be used to counteract imprecision in static analyses, enabling their use in a much wider variety of applications. These assumptions are taken by the analyzer non-deterministically, resulting in a function from sets of accepted assumptions to the resulting analysis under those assumptions. We also demonstrate the utility of such a function in two ways, both of which showcase how it can enable optimization over a search space of assumptions that is otherwise infeasible without the specified analysis.
Fields of Study & Subjects
Logic
programming
and type systems
Software Testing and Debugging Techniques
Formal Methods in Verification
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 7 February 2026
- Language
- EN
- Document type
- Preprint