Skip to content

Open-Source LLM-Driven Formal Verification: A Multi-Agent Pipeline for RTL Repair

Jul 2026 · arXiv.org · Vol abs/2607.28877 · 0 citations · 9 references
Computer Science

TL;DR

A multi-agent pipeline that couples an LLM with an open-source formal backend to repair RTL through counterexample-guided iteration and additionally reports a practical limitation of the Yosys bind directive relevant to the open-source formal verification community.

Abstract

Verification consumes the majority of modern chip design effort, yet the formal verification tools that provide mathematical guarantees of correctness remain expensive and restrictively licensed. While large language models (LLMs) have shown promise for hardware design, existing approaches to RTL repair validate their results through simulation - which exercises only a subset of inputs - or rely on commercial tools, and few combine formal proof with an entirely open-source toolchain. In this paper, we present a multi-agent pipeline that couples an LLM with an open-source formal backend (Yosys, SymbiYosys, and Z3) to repair RTL through counterexample-guided iteration: the framework generates formal properties, verifies the design, and feeds counterexamples back to the LLM until the design is proved correct by k-induction or an iteration budget is exhausted. Through an ALU case study, we show that the pipeline can detect and repair a real functional bug with a formal proof of correctness. Across a six-benchmark suite, one design is repaired reliably, and we characterize four distinct failure modes: bounded-cover vacuity, specification ambiguity, temporal-logic bugs, and multi-property pressure. We frame this work as a feasibility study with a detailed failure analysis, and additionally report a practical limitation of the Yosys bind directive relevant to the open-source formal verification community.

View source

Similar papers

Conference Aug 2026

Dual-Side Verification for Trustworthy LLM-Based Constrained Resource-Task Assignment Modeling

Constrained resource-task assignment(RTA) is a foundational problem in operations research and engineering decision support. Turning a natural-language assignment description into a correct optimization model and executable solver code requires expertise in both application semantics and mathematical programming. Large...

Bing-Xu Zhang, Tian-Le Pu, Long-Fei Zhang et al. · 0 citations
Preprint Sep 2026

LLM-enabled Behavior Driven Development Workflow for Formally Verified Hardware Designs

This work proposes an integrated view on the use of LLMs for EDA and establishes an LLM-enabled behavior driven hardware development workflow, introducing and defining Formal Verification Gherkin Scenarios (FV Gherkin Scenarios), unlocking CNL specifications as the foundation for formally verified hardware designs via...

Luca Müller, Qian Liu, Rolf Drechsler · 0 citations
Conference Open access Sep 2026

QiMeng-VPID: Verification-Grounded Port-Level Iterative Decomposition for Complex Verilog Generation

This work proposes VPID, a multi-agent framework for generating complex Verilog that achieves monotonic functional improvement and introduces an experience-guided refinement strategy that distills historical waveform mismatches into constraints, guiding the targeted debugging for the unverified ports.

Hong-Guang Wang, Jiaming Guo, Rui Zhang et al. · 0 citations
Book Open access Aug 2026

StarVerus: LLM-Powered Multi-Agent Collaboration for Industrial Rust Code Verification Automation

A multi-agent collaborative framework, StarVerus, to automate the verification of industrial Rust code and introduces a planner-repairer-actor-rewriter multi-agent paradigm to further enhance the proof repair capabilities.

Chao Jiang, Ding Wang, Du-Gang Liu et al. · 0 citations
Preprint Sep 2026

SLED-IFV: Solver-Validated LLM-Guided Decomposition for Scalable Hardware Information-Flow Verification

This work identifies two recurring proof barriers in self-composed IFV: implementation complexity, where proof-hard datapath logic dominates even though the property needs only a compact boundary relation, and relational inductive complexity, where the proof depends on cross-copy public-control facts that the backend p...

Liangtao Dai, Yimin Gao, Melika Morsali et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.