Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Bardia Nadimi

dblp:263/6706 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-2055-349XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 100%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code generation with language models
0.912025
PyraNet: A Multi-Layered Hierarchical Dataset for Verilog · DAC 2025
Program synthesis and code generation › code generation with language models
verilog code generation
0.912025
PyraNet: A Multi-Layered Hierarchical Dataset for Verilog · DAC 2025
Electronic design automation
hardware verification and test
0.812024
AutoModel: Automatic Synthesis of Models From Communication Traces of SoC Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Electronic design automation › hardware verification and test
specification mining
0.812024
AutoModel: Automatic Synthesis of Models From Communication Traces of SoC Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Electronic design automation
system-level simulation
0.812024
AutoModel: Automatic Synthesis of Models From Communication Traces of SoC Designs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024

Methods — techniques the papers use, named apart from their topics

large language model · 1.7fine-tuning · 1.7satisfiability modulo theories · 0.8causality graph · 0.8
YearPublicationVenuePosition
2025 PyraNet: A Multi-Layered Hierarchical Dataset for Verilog
abstract
Recently, there has been a growing interest in leveraging Large Language Models for Verilog code generation. However, the current quality of the generated Verilog code remains suboptimal. This is largely due to the absence of well-defined, well-organized datasets with high-quality samples, as well as a lack of innovative fine-tuning methods and models specifically trained on Verilog. In this paper, we introduce a novel open-source dataset and a corresponding fine-tuning technique, which utilizes a multi-layered structure that we refer to as PyraNet. Our experiments demonstrate that employing the proposed dataset and fine-tuning approach leads to a more accurate fine-tuned model, producing syntactically and functionally correct Verilog code. The evaluation results show improvements by up-to 32.6% in comparison to the CodeLlama-7B baseline model and upto 16.7% in comparison to the state-of-the-art models using VerilogEval evaluation platform.
Bardia Nadimi, Ghali Omar Boutaib, Hao Zheng 0001
DAC1
2024 AutoModel: Automatic Synthesis of Models From Communication Traces of SoC Designs
abstract
Modeling system-level behaviors of intricate System-on-Chip (SoC) designs is crucial for design analysis, testing, and validation. This paper presents an approach, AutoModel, to automatically inferring concise and abstract models from SoC communication traces, capturing the system-level protocols that govern co-ordinations among design blocks for various system functions. In this approach, a causality graph with annotations obtained from the SoC traces is constructed first. The annotated causality graph represents all potential causality relations among messages under consideration. Next, a constraint satisfaction problem is formulated from the causality graph, which is then solved by a satisfiability modulo theories (SMT) solver to find satisfying solutions. Finally, finite state models are extracted from the generated solutions, which can be used to explain and understand the input traces. The proposed approach is validated through experiments using synthetic traces obtained from simulating a transaction-level model of a multicore SoC design and traces collected from running real programs on a realistic multicore SoC modeled in gem5.
Md Rubel Ahmed, Bardia Nadimi, Hao Zheng 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2