[Paper] Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection

Source: arXiv - 2606.08852v1

Overview

Exploiting parallelism in modern CPU architectures remains a longstanding challenge in optimizing SMT solvers. We introduce a novel parallel framework that dynamically builds a binary partition tree of the search space by sampling from workers’ VSIDS statistics during solving. We leverage the full power of core-based CDCL-style pruning to continuously shrink the partition tree. We further optimize our architecture by incorporating online backbone detection into worker threads, as well as a terminate-on-demand mechanism to eagerly eliminate work on pruned subproblems. The resulting algorithm is highly generalizable and scales effectively with available resources. We implement our approach in the Z3 SMT solver and demonstrate that it outperforms both sequential Z3 and existing state-of-the-art parallel frameworks on challenging benchmarks from six logics in the SMT-COMP 2025 Parallel Track.

Key Contributions

This paper presents research in the following areas:

• cs.LO
• cs.DC

Methodology

Please refer to the full paper for detailed methodology.

Practical Implications

This research contributes to the advancement of cs.LO.

Authors

• Ilana Shapiro
• Sorin Lerner
• Nikolaj Bjørner

Paper Information

• arXiv ID: 2606.08852v1
• Categories: cs.LO, cs.DC
• Published: June 7, 2026
• PDF: Download PDF