Logo image
Flexible Proof Production in an Industrial-Strength SMT Solver
Conference proceeding   Open access   Peer reviewed

Flexible Proof Production in an Industrial-Strength SMT Solver

Haniel Barbosa, Andrew Reynolds, Gereon Kremer, Hanna Lachnitt, Aina Niemetz, Andres Notzli, Alex Ozdemir, Mathias Preiner, Arjun Viswanathan, Scott Viteri, …
AUTOMATED REASONING, IJCAR 2022, Vol.13385, pp.15-35
Lecture Notes in Artificial Intelligence
01/01/2022
DOI: 10.1007/978-3-031-10769-6_3
url
https://doi.org/10.1007/978-3-031-10769-6_3View
Published (Version of record) Open Access

Abstract

Proof production for SMT solvers is paramount to ensure their correctness independently from implementations, which are often prohibitively difficult to verify. Historically, however, SMT proof production has struggled with performance and coverage issues, resulting in the disabling of many crucial solving techniques and in coarse-grained (and thus hard to check) proofs. We present a flexible proof-production architecture designed to handle the complexity of versatile, industrial-strength SMT solvers and show how we leverage it to produce detailed proofs, including for components previously unsupported by any solver. The architecture allows proofs to be produced modularly, lazily, and with numerous safeguards for correctness. This architecture has been implemented in the state-of-the-art SMT solver cvc5. We evaluate its proofs for SMT-LIB benchmarks and show that the new architecture produces better coverage than previous approaches, has acceptable performance overhead, and supports detailed proofs for most solving components.
Computer Science Logic Mathematics Physical Sciences Technology Computer Science, Artificial Intelligence Computer Science, Theory & Methods Mathematics, Applied Science & Technology Science & Technology - Other Topics

Details

Metrics

Logo image