arXiv AI By Haotian Qiao, Robert P. Dick

Faithful and Complete LLM-Assisted Automated Construction of Hierarchical Hardware Knowledge Graphs

Read the original on arXiv AI →

The paper introduces an automated pipeline that uses large language models to convert hardware datasheets into hierarchical knowledge graphs. By chunking documents, routing extracted properties, and iteratively refining the graph, the method preserves source provenance and reduces context size per query. Evaluation on 20 datasheets shows a 98.8% property faithfulness and 83.6% coverage of baseline properties, outperforming a one‑shot baseline.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 31

LLM-Driven, Datasheet-Aware Automated Hardware Compatibility Verification for Early-Stage, Pre-Schematic Embedded System Design

The paper introduces an LLM‑driven, datasheet‑aware framework that performs early‑stage hardware compatibility verification for embedded systems. By building a design graph from datasheets and high‑level connectivity descriptions, it retrieves only the engineering properties needed for domain‑oriented verification criteria and generates deterministic scripts for evaluation. The approach decomposes compatibility analysis into modular stages, preserves intermediate results, and reduces context overhead, achieving 97.5% accuracy on seven designs while cutting input context size by 8.6× compared to traditional upload‑and‑query workflows.

By Haotian Qiao, Robert P. Dick
arXiv Machine Learning
Sep 11

Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)

The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.

By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello
arXiv AI
Oct 9

A Survey on LLM-Integrated Hardware Design Verification

The paper surveys how large language models (LLMs) are being used in hardware verification, covering tasks such as assertion generation, testbench creation, bug localization, and formal reasoning. It categorizes the literature by methodology, verification goal, tool interaction, benchmarks, and evaluation metrics, and distinguishes between inference-time techniques (prompting, retrieval, structured reasoning, agentic workflows) and training-time adaptation. The authors highlight that LLMs excel as semantic reasoning, search, and orchestration components within verification workflows, yet emphasize the need for semantic alignment, scalable integration, generalization, and rigorous evaluation to ensure true verification correctness.

By Hao Zheng, Jaime Rafael Imperial, Bardia Nadimi, Xiangfei Kong