mlsanityData to 14 Oct 2026

Free and Fair Hardware: A Pathway to Copyright Infringement-Free Verilog Generation using LLMs

arXiv 2505.06096 ↗First posted 9 May 2025cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Limitations in Large Language Model (LLM) capabilities for hardware design tasks, such as generating functional Verilog codes, have motivated various fine-tuning optimizations utilizing curated hardware datasets from open-source repositories. However, these datasets remain limited in size and contain minimal checks on licensing for reuse, resulting in potential copyright violations by fine-tuned LLMs. Therefore, we propose an evaluation benchmark to estimate the risk of Verilog-trained LLMs to generate copyright-protected codes. To minimize this risk, we present an open-source Verilog dataset, FreeSet, containing over 220k files, along with the automated dataset curation framework utilized to provide additional guarantees of fair-use Verilog data. We then execute an LLM fine-tuning framework consisting of continual pre-training, resulting in a fine-tuned Llama model for Verilog, FreeV. Our results indicate that FreeV demonstrates the smallest risk of copyright-infringement among prior works, with only a 3% violation rate. Furthermore, experimental results demonstrate improvements in Verilog generation functionality over its baseline model, improving VerilogEval pass@10 rates by over 10%.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 9 May 2025.

Builds on

25 of 37 references.

References · 25

  1. 2017Attention Is All You Needcited by 60,361
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2023Code Llama: Open Foundation Models for Codecited by 2,139
  5. 2024DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligencecited by 1,181
  6. 2022The Stack: 3 TB of permissively licensed source codecited by 359
  7. 2024DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligencecited by 331
  8. 2023VeriGen: A Large Language Model for Verilog Code Generationcited by 200
  9. 2023RTLLM: An Open-Source Benchmark for Design RTL Generation with Large Language Modelcited by 148
  10. 2023Chip-Chat: Challenges and Opportunities in Conversational Hardware Designcited by 140
  11. 2023ChipGPT: How far are we from natural language hardware designcited by 105
  12. 2023RTLFixer: Automatically Fixing RTL Syntax Errors with Large Language Modelscited by 100
13 more
  1. 2024BetterV: Controlled Verilog Generation with Discriminative Guidancecited by 100
  2. 2023AutoChip: Automating HDL Generation Using LLM Feedbackcited by 83
  3. 2023RTLCoder: Outperforming GPT-3.5 in Design RTL Generation with Our Open-Source Dataset and Lightweight Solutioncited by 71
  4. 2024OriGen:Enhancing RTL Code Generation with Code-to-Code Augmentation and Self-Reflectioncited by 56
  5. 2024Make Every Move Count: LLM-based High-Quality RTL Code Generation Using MCTScited by 43
  6. 2024CraftRTL: High-quality Synthetic Data Generation for Verilog Code Models with Correct-by-Construction Non-Textual Representations and Targeted Code Repaircited by 42
  7. 2023LLM4EDA: Emerging Progress in Large Language Models for Electronic Design Automationcited by 40
  8. 2024Copyright Traps for Large Language Modelscited by 37
  9. 2024SHIELD: Evaluation and Defense Strategies for Copyright Compliance in LLM Text Generationcited by 34
  10. 2025OpenLLM-RTL: Open Dataset and Benchmark for LLM-Aided Design RTL Generationcited by 31
  11. 2024Digger: Detecting Copyright Content Mis-usage in Large Language Model Trainingcited by 25
  12. 2024Exploring Memorization and Copyright Violation in Frontier LLMs: A Study of the New York Times v. OpenAI 2023 Lawsuitcited by 18
  13. 2021GNN4IP: Graph Neural Network for Hardware Intellectual Property Piracy Detectioncited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.