Shared-Context Batched Satisfiability
This paper studies and compares three strategies for solving shared-context batched satisfiability in program analyzers.
The paper introduces a new algorithm, Core-Literal Filter (CLF), and evaluates its performance alongside two existing strategies.
Before reading this…
Applications
- →Symbolic abstraction
- →Active property checking
To understand this paper, make sure you know these concepts first:
- Program analyzersfind papers →
- Satisfiabilityfind papers →
Abstract
More Like ThisProgram analyzers often issue batches of SMT queries that share a large symbolic context and differ only in a small predicate. We formalize this recurring pattern as \emph{Shared-Context Batched Satisfiability}: given a formula $\varphi$ and predicates $P$, determine whether $\varphi \land p$ is satisfiable for each $p \in P$. We study three theory-agnostic strategies for this problem: predicate-by-predicate checking, disjunctive over-approximation, and Core-Literal Filter (CLF), a new algorithm that learns literals inconsistent with $\varphi$ and uses them to reject later predicates. Our evaluation on symbolic abstraction and active property checking shows that no strategy dominates universally: over-approximation is fastest on solved symbolic-abstraction queries, while CLF increases the number of solved hard instances and is fastest on active property checking. We advocate treating shared-context batched satisfiability as a first-class primitive in design program analyzers and exploring the algorithmic design space more systematically.