VeriLoC: Line-of-Code Level Prediction of Hardware Design Quality from Verilog Code
Not on the map. Why?
Abstract (arXiv)
Modern chip design is complex, and there is a crucial need for early-stage prediction of key design-quality metrics like timing and routing congestion directly from Verilog code (a commonly used programming language for hardware design). It is especially important yet complex to predict individual lines of code that cause timing violations or downstream routing congestion. Prior works have tried approaches like converting Verilog into an intermediate graph representation and using LLM embeddings alongside other features to predict module-level quality, but did not consider line-level quality prediction. We propose VeriLoC, the first method that predicts design quality directly from Verilog at both the line- and module-level. To this end, VeriLoC leverages recent Verilog code-generation LLMs to extract local line-level and module-level embeddings, and train downstream classifiers/regressors on concatenations of these embeddings. VeriLoC achieves high F1-scores of 0.86-0.95 for line-level congestion and timing prediction, and reduces the mean average percentage error from 14% - 18% for SOTA methods down to only 4%. We believe that VeriLoC embeddings and insights from our work will also be of value for other predictive and optimization tasks for complex hardware design.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 56 references that are in the map. First posted on arXiv 8 Jun 2025.
Builds on
28 of 56 references.
References · 28
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,286
- 2020GraphCodeBERT: Pre-training Code Representations with Data Flowcited by 600
- 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 396
- 2023VerilogEval: Evaluating Large Language Models for Verilog Code Generationcited by 246
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 218
- 2023VeriGen: A Large Language Model for Verilog Code Generationcited by 197
- 2023RTLLM: An Open-Source Benchmark for Design RTL Generation with Large Language Modelcited by 143
- 2023InferFix: End-to-End Program Repair with LLMscited by 113
- 2024BetterV: Controlled Verilog Generation with Discriminative Guidancecited by 99
- 2023RTLFixer: Automatically Fixing RTL Syntax Errors with Large Language Modelscited by 98
16 more
- 2020Automated Concatenation of Embeddings for Structured Predictioncited by 86
- 2023RTLCoder: Outperforming GPT-3.5 in Design RTL Generation with Our Open-Source Dataset and Lightweight Solutioncited by 69
- 2019DRiLLS: Deep Reinforcement Learning for Logic Synthesiscited by 47
- 2024CodeV: Empowering LLMs with HDL Generation through Multi-Level Summarizationcited by 38
- 2021OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesiscited by 30
- 2024RTLRewriter: Methodologies for Large Models aided RTL Code Optimizationcited by 30
- 2024Rome was Not Built in a Single Step: Hierarchical Prompting for LLM-based Chip Designcited by 24
- 2023MasterRTL: A Pre-Synthesis PPA Estimation Framework for Any RTL Designcited by 19
- 2022LHNN: Lattice Hypergraph Neural Network for VLSI Congestion Predictioncited by 18
- 2021Generalizable Cross-Graph Embedding for GNN-based Congestion Predictioncited by 17
- 2025CircuitFusion: Multimodal Circuit Representation Learning for Agile Chip Designcited by 14
- 2024Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimizationcited by 10
- 2025Beyond Decoder-only: Large Language Models Can be Good Encoders for Machine Translationcited by 8
- 2024Annotating Slack Directly on Your Verilog: Fine-Grained RTL Timing Evaluation for Early Optimizationcited by 6
- 2024The Graph's Apprentice: Teaching an LLM Low Level Knowledge for Circuit Quality Estimationcited by 3
- 2020Workshops on Extreme Scale Design Automation (ESDA) Challenges and Opportunities for 2025 and Beyondcited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.