mlsanityData to 14 Oct 2026

Certified Program Synthesis with a Multi-Modal Verifier

arXiv 2604.16584 ↗First posted 17 Apr 2026cs.SE cs.AI cs.PLcited by 2

Not on the map. Why?

Abstract (arXiv)

Certified program synthesis (aka vericoding) is the process of automatically generating a program, its formal specification, and a machine-checkable proof of their alignment from a natural-language description. Two challenges make vericoding difficult. First, specifications synthesised from natural language are often either too weak to be meaningful or too strong to be implementable, yet existing approaches lack systematic means to detect such defects. Second, the landscape of program verifiers is fragmented: each tool supports a particular reasoning mode -- auto-active (e.g., Dafny, Verus) or interactive (e.g., Coq, Lean) -- with its own trade-off between automation and expressivity. This forces every synthesis methodology to be tailored to a single verification paradigm, limiting the class of tasks it can handle effectively. We overcome both challenges by structuring the certified synthesis workflow around a multi-modal verifier -- a single tool combining dynamic validation, automated proofs, and interactive proof scripting in one foundational framework. We realise this idea in LeetProof, an agentic pipeline built on Velvet, a multi-modal verifier embedded in Lean. Multi-modality enables LeetProof to validate generated specifications via randomised property-based testing before any code is synthesised, decompose the synthesis task into sub-problems guided by verification conditions, and delegate residual proof obligations to frontier AI provers specialised for Lean. We evaluate LeetProof on benchmarks derived from prior work on certified synthesis. Our specification validation uncovers defects in existing reference benchmarks, and LeetProof's staged pipeline achieves a significantly higher rate of fully certified solutions than a single-mode baseline at the same budget -- consistently across two frontier LLM backends.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 72 references that are in the map. First posted on arXiv 17 Apr 2026.

Builds on

22 of 72 references.

References · 22

  1. 2019The Lean mathematical librarycited by 134
  2. 2023Clover: Closed-Loop Verifiable Code Generationcited by 67
  3. 2025Hilbert: Recursively Building Formal Proofs with Informal Reasoningcited by 60
  4. 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Leancited by 58
  5. 2024DafnyBench: A Benchmark for Formal Software Verificationcited by 57
  6. 2024AutoVerus: Automated Proof Generation for Rust Codecited by 49
  7. 2024AlphaVerus: Bootstrapping Formally Verified Code Generation through Self-Improving Translation and Treefinementcited by 35
  8. 2025VERINA: Benchmarking Verifiable Code Generationcited by 34
  9. 2024Automated Proof Generation for Rust Code via Self-Evolutioncited by 33
  10. 2025CLEVER: A Curated Benchmark for Formally Verified Code Generationcited by 29
  11. 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verificationcited by 27
  12. 2024Towards Neural Synthesis for SMT-Assisted Proof-Oriented Programmingcited by 20
10 more
  1. 2024Evaluating LLM-driven User-Intent Formalization for Verification-Aware Languagescited by 16
  2. 2024Laurel: Unblocking Automated Verification with Large Language Modelscited by 11
  3. 2026DafnyPro: LLM-Assisted Automated Verification for Dafny Programscited by 11
  4. 2024Cobblestone: A Divide-and-Conquer Approach for Automating Formal Verificationcited by 9
  5. 2025Lean-SMT: An SMT tactic for discharging proof goals in Leancited by 9
  6. 2025Lean-auto: An Interface between Lean 4 and Automated Theorem Proverscited by 6
  7. 2025Agentic Verification of Software Systemscited by 6
  8. 2025ATLAS: Automated Toolkit for Large-Scale Verified Code Synthesiscited by 4
  9. 2018Structuring the Synthesis of Heap-Manipulating Programs - Extended Versioncited by 3
  10. 2025The Search for Constrained Random Generatorscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Reducing the Costs of Proof Synthesis on Rust Systems by Scaling Up a Seed Training Set
  2. 2026Intent-aligned Formal Specification Synthesis via Traceable Refinement
  3. 2026Automating Formal Verification with Agent-Guided Tree Search
  4. 2025VeriEquivBench: An Equivalence Score for Ground-Truth-Free Evaluation of Formally Verifiable Code
  5. 2026Automating Formal Verification with Reinforcement Learning and Recursive Inference
  6. 2024VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search
  7. 2026Spec-Harness: Assessing and Guiding LLM-Synthesized Formal Specifications Beyond Verifiability
  8. 2026Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models