RuC: HDL-Agnostic Rule Completion Benchmark Generation

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Domingo, Arnau Ayguadé, Alberti-Binimelis, Miquel, Gutierrez-Gomez, Cristian, Parisi, Emanuele, Ghorab, Razine Moundir, Moreto, Miquel, Kestor, Gokcen, Garcia-Gasulla, Dario
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910180394926080
author Domingo, Arnau Ayguadé
Alberti-Binimelis, Miquel
Gutierrez-Gomez, Cristian
Parisi, Emanuele
Ghorab, Razine Moundir
Moreto, Miquel
Kestor, Gokcen
Garcia-Gasulla, Dario
author_facet Domingo, Arnau Ayguadé
Alberti-Binimelis, Miquel
Gutierrez-Gomez, Cristian
Parisi, Emanuele
Ghorab, Razine Moundir
Moreto, Miquel
Kestor, Gokcen
Garcia-Gasulla, Dario
contents Large Language Models (LLMs) have rapidly improved in performance across code-related tasks, making their integration into Register Transfer Level (RTL) development increasingly attractive. Mimicking the behavior of inline code assistants, many benchmarks evaluate LLMs' capabilities in code completion, either assessing the generation of entire hardware modules or the completion of a single line within a module. However both of these approaches lack the ability to control the granularity of the code-completion sample size and the syntactic range of completions. To overcome these limitations, we present a framework for language-agnostic rule completion (RuC), a grammar-driven, rule-selectable benchmark generator that automatically produces RTL code-completion tasks from a set of input hardware description sources. RuC uses the target Hardware Description Language (HDL) grammar to mask syntactically defined code regions and prompts a model to regenerate them using the surrounding unmasked code as context, enabling a controlled and scalable evaluation of the domain-specific model's code-understanding capabilities, ranging from assignments to the reconstruction of entire logic blocks. We use RuC to generate two SystemVerilog rule-completion benchmarks from the Tiny Tapeout shuttle TT07 and the CVE2 RISC-V core to demonstrate RuC's applicability to a broad range of designs, and conduct a comparative study of the code completion capabilities of modern open-source LLMs across diverse settings. Results indicate that completion performance strongly depends on the model type, the grammatical structure of the masked region, and the prompting strategy. Specifically, the highest scores are obtained with Fill-in-the-Middle (FIM) prompting. These findings highlight the value of grammar-driven, arbitrarily granular benchmarks for meaningful evaluation of LLM capabilities in RTL development workflows.
format Preprint
id arxiv_https___arxiv_org_abs_2604_27780
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle RuC: HDL-Agnostic Rule Completion Benchmark Generation
Domingo, Arnau Ayguadé
Alberti-Binimelis, Miquel
Gutierrez-Gomez, Cristian
Parisi, Emanuele
Ghorab, Razine Moundir
Moreto, Miquel
Kestor, Gokcen
Garcia-Gasulla, Dario
Hardware Architecture
Artificial Intelligence
Large Language Models (LLMs) have rapidly improved in performance across code-related tasks, making their integration into Register Transfer Level (RTL) development increasingly attractive. Mimicking the behavior of inline code assistants, many benchmarks evaluate LLMs' capabilities in code completion, either assessing the generation of entire hardware modules or the completion of a single line within a module. However both of these approaches lack the ability to control the granularity of the code-completion sample size and the syntactic range of completions. To overcome these limitations, we present a framework for language-agnostic rule completion (RuC), a grammar-driven, rule-selectable benchmark generator that automatically produces RTL code-completion tasks from a set of input hardware description sources. RuC uses the target Hardware Description Language (HDL) grammar to mask syntactically defined code regions and prompts a model to regenerate them using the surrounding unmasked code as context, enabling a controlled and scalable evaluation of the domain-specific model's code-understanding capabilities, ranging from assignments to the reconstruction of entire logic blocks. We use RuC to generate two SystemVerilog rule-completion benchmarks from the Tiny Tapeout shuttle TT07 and the CVE2 RISC-V core to demonstrate RuC's applicability to a broad range of designs, and conduct a comparative study of the code completion capabilities of modern open-source LLMs across diverse settings. Results indicate that completion performance strongly depends on the model type, the grammatical structure of the masked region, and the prompting strategy. Specifically, the highest scores are obtained with Fill-in-the-Middle (FIM) prompting. These findings highlight the value of grammar-driven, arbitrarily granular benchmarks for meaningful evaluation of LLM capabilities in RTL development workflows.
title RuC: HDL-Agnostic Rule Completion Benchmark Generation
topic Hardware Architecture
Artificial Intelligence
url https://arxiv.org/abs/2604.27780