paper-with-me

Papers

Saarthi: The First AI Formal Verification Engineer

2025-02-23 · Aman Kumar, Deepak Narayan Gadde, Keerthan Kopparam Radhakrishna, Djones Lettnin

Recently, Devin has made a significant buzz in the Artificial Intelligence (AI) community as the world's first fully autonomous AI software engineer, capable of independently developing software code. Devin uses the concept of agentic workflow in Generative AI (GenAI), which empowers AI agents to engage in a more dynamic, iterative, and self-reflective process. In this paper, we present a similar fully autonomous AI formal verification engineer, Saarthi, capable of verifying a given RTL design end-to-end using an agentic workflow. With Saarthi, verification engineers can focus on more complex problems, and verification teams can strive for more ambitious goals. The domain-agnostic implementation of Saarthi makes it scalable for use across various domains such as RTL design, UVM-based verification, and others.

📄 PDF Abstract BibTeX arXiv:2502.16662

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Saarthi for AGI: Towards Domain-Specific General Intelligence for Formal Verification

2026-03-03 · Aman Kumar, Deepak Narayan Gadde, Luu Danh Minh, Vaisakh Naduvodi Viswambharan 외 arxiv

Saarthi is an agentic AI framework that uses multi-agent collaboration to perform end-to-end formal verification. Even though the framework provides a complete flow from specification to coverage closure, with around 40%…

APE-Bench I: Towards File-level Automated Proof Engineering of Formal Math Libraries

2025-04-27 · Huajian Xin, Luming Li, Xiaoran Jin, Jacques Fleuriot 외

Recent progress in large language models (LLMs) has shown promise in formal theorem proving, yet existing benchmarks remain limited to isolated, static proof tasks, failing to capture the iterative, engineering-intensive…

Automated Theorem ProvingBug fixingMath

AI for software engineering: from probable to provable

2025-11-28 · Bertrand Meyer arxiv

Vibe coding, the much-touted use of AI techniques for programming, faces two overwhelming obstacles: the difficulty of specifying goals ("prompt engineering" is a form of requirements engineering, one of the toughest dis…

Prompt Engineering

ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers

2025-12-24 · Chen Chen, Daniela Kaufmann, Chenhui Deng, Zhan Song 외 arxiv

We present ReVEAL, a graph-learning-based method for reverse engineering of multiplier architectures to improve algebraic circuit verification techniques. Our framework leverages structural graph features and learning-dr…

Analogous Alignments: Digital "Formally" meets Analog

2024-09-23 · Hansa Mohanty, Deepak Narayan Gadde

The complexity of modern-day System-on-Chips (SoCs) is continually increasing, and it becomes increasingly challenging to deliver dependable and credible chips in a short time-to-market. Especially, in the case of test c…