Efficient Volume Computation for SMT Formulas

2025-08-13

AI Summary

This work addresses the problem of computing the volume of the satisfiable region for linear real arithmetic (LRA) SMT formulas—a task critical to quantitative analysis in software verification, cyber-physical systems, and neural networks. Existing approaches suffer from low efficiency and poor scalability on complex formulas. To overcome these limitations, we propose the *ttc* algorithm: it decomposes the solution space via AllSAT-driven enumeration, represents the satisfiable set as a union of overlapping convex polyhedra, and introduces a streaming union operation to enable efficient, joint volume computation—marking the first method to achieve scalable volume estimation for general LRA SMT formulas. Evaluated on multiple benchmarks, *ttc* outperforms the state-of-the-art by over an order of magnitude in average runtime while significantly extending the quantitative reasoning capabilities of SMT solvers.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving
• Machine Learning: Calibration & Uncertainty Quantification

Application Category

• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs

Abstract

Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiability methods confined to Boolean variables, SMT can reason on real-life variables like bitvectors, integers, and reals. A natural extension in this context is to ask quantitative questions. One such query in the SMT theory of Linear Real Arithmetic (LRA) is computing the volume of the entire satisfiable region defined by SMT formulas. This problem is important in solving different quantitative verification queries in software verification, cyber-physical systems, and neural networks, to mention a few. We introduce ttc, an efficient algorithm that extends the capabilities of SMT solvers to volume computation. Our method decomposes the solution space of SMT Linear Real Arithmetic formulas into a union of overlapping convex polytopes, then computes their volumes and calculates their union. Our algorithm builds on recent developments in streaming-mode set unions, volume computation algorithms, and AllSAT techniques. Experimental evaluations demonstrate significant performance improvements over existing state-of-the-art approaches.

Problem

• Efficiently compute volume of SMT satisfiable regions
• Extend SMT solvers to handle quantitative verification queries
• Decompose SMT solution space into overlapping convex polytopes

Innovation

• Extends SMT solvers for volume computation
• Decomposes solution space into convex polytopes
• Uses streaming-mode set unions and AllSAT