ChipMEM: Verification-Grounded Memory for EDA Agents
cs.LG, cs.CL
Submitted: 2026-09-22
Updated: 2026-09-22
Code: https://github.com/aalrabah/ChipMEM
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Large language model (LLM)-based agents use Electronic Design Automation (EDA) tools to generate and revise register-transfer-level (RTL) designs under synthesis and verification feedback.
Terminology
Abstract
Large language model (LLM)-based agents use Electronic Design Automation (EDA) tools to generate and revise register-transfer-level (RTL) designs under synthesis and verification feedback. Recent methods learn from this feedback by distilling reusable skills from execution traces or by training on rewards derived from EDA-tools. Both methods are typically evaluated on the tasks that produced the experience. Repeated access to benchmark feedback on the same task can reward task-specific revision rather than creating reusable knowledge that transfers. We introduce ChipMEM, a verification-grounded memory layer for EDA agents. It combines cross-task procedural memory with within-trajectory statistical guidance. Its procedural component distills and stores a skill only after it passes synthesis, simulation, or formal checks, rather than relying on model self-assessments. A Bayesian component maintains hierarchical Beta estimates over tool-call outcomes and ranks recovery strategies that succeeded under comparable errors. A common adapter applies the same memory interface to RTL optimization and testbench-generation agents while preserving each domain's tools and acceptance criteria. We measure performance on training tasks and evaluate whether learned skills transfer to unseen tasks. On RTLRewriter-Bench, under matched model and tool settings, ChipMEM produces equivalence-passing outputs on 39/54 scored designs versus 35/54 without memory; on the 49-design short suite, mean area improvement is 8.69% versus 5.66%. On held-out CVDP tasks, ChipMEM with a frozen procedural library achieves 20/20 accepted outcomes versus 18/20 without memory in a single evaluation per setting.
Sources
- RTLScout: Joint Agentic Code and Synthesis Optimization for Efficient Digital Circuits
- SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?
- Trace2Skill: Verifier-Guided Skill Evolution for Long-Context EDA Agents
- Dr. RTL: Autonomous Agentic RTL Optimization through Tool-Grounded Self-Improvement
- EvolVE: Evolutionary Search for LLM-based Verilog Generation and Optimization
- A New Benchmark for the Appropriate Evaluation of RTL Code Optimization
- ReasoningBank: Scaling Agent Self-Evolving with Reasoning Memory
- Comprehensive Verilog Design Problems: A Next-Generation Benchmark Dataset for Evaluating Large Language Models and Agents on RTL Design and Verification
- POET: Power-Oriented Evolutionary Tuning for LLM-Based RTL PPA Optimization
- EARL: Entropy-Aware RL Alignment of LLMs for Reliable RTL Code Generation
- Voyager: An Open-Ended Embodied Agent with Large Language Models
- VeriAgent: A Tool-Integrated Multi-Agent System with Evolving Memory for PPA-Aware RTL Code Generation
- SkillOpt: Executive Strategy for Self-Evolving Agent Skills
- Agentic Hardware Design as Repository-Level Code Evolution
- Alpha-RTL: Test-Time Training for RTL Hardware Optimization
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks