Proof Production for Satisfiability Modulo Finite Fields with Proof Checking in Pacheck and Lean

Pedro Saccomani Abdalrhman Mohamed Elizaveta Pertseva Daniela Kaufmann Cesare Tinelli Clark W. Barrett Haniel Barbosa

· 0 citations · 30 references

TL;DR

This work proposes a proof calculus that captures the decision procedure for finite field reasoning employed by the SMT solver CVC 5 and instrumenting the solver to generate proofs within this calculus, and introduces an extension of the Practical Algebraic Calculus that mirrors the proposed system.

Semantic Scholar

View source

Similar papers

A light-weight proof checker for TSTP refutations

A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.

Melanie Taprogge, H. Sariyanto, Alexander Steen · 1 citation

Review Aug 2026

Does the Proof Prove It That Way? Faithful Formalization of Elements Proofs

Pistis is introduced, an agentic, oracle-guided proof search that produces formal Lean proofs that satisfy faithfulness conditions and can accept or refute natural language proofs written by humans or AI, demonstrating that faithful formalization is useful as a proof-checking tool.

Tadd Mao, Tianjun Zhong, Dhruva Arekar et al. · 1 citation

Preprint Aug 2026

ProofPulse: Interactive Proof Coverage Analysis for Dafny

Evaluated against an oracle of 252 programs from the dafny-synthesis benchmark, ProofPulse provides a high-precision signal for specification weaknesses, particularly unnecessary preconditions and vacuous proofs.

Álvaro F. Silva, Ruben Martins, Alexandra Mendes · 0 citations

Open access Oct 2026

LLM-Assisted Unsatisfiability Proofs for Satisfiability Modulo Theories, Oracles, and Natural Language

Modern software systems routinely invoke components whose source code is unavailable, such as proprietary libraries or cloud-based APIs. Such closed-box functions provide only oracle-style access: they can be executed on concrete inputs, but their internal logic cannot be inspected. Prior work has explored augmenting S...

Gourav Takhar, S. Lahiri, P. Kalita et al. · 0 citations

Preprint Sep 2026

Synthesizing Proofs Using Proof Sharding and Exploration

Distributed systems are hard to implement correctly, and subtle bugs can go undetected using traditional testing. Formal verification offers an alternative for proving the correctness of complex distributed systems. Despite previous efforts to automate and facilitate formal verification, it is still hard to integrate f...

Seyed Armin Vakil Ghahani, M. Kapritsos · 0 citations

SymCert: Verifying SMT-Based Policy Analyses

SymCert is presented, a framework implemented in Lean for building verified SMT-based analyses of Cedar policies that provide a verified symbolic compiler and authorizer for reducing policies to SMT formulas, a hierarchy enforcer for ensuring well-formedness of counterexamples, and a counterex-ample extractor for provi...

Emina Torlak · 0 citations