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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mahsa Heidari

dblp:237/7115 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-4030-0775ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › debugging
bug localization
0.912025
Localizing Multiple Bugs in RTL Designs by Classifying Hit-Statements Using Neural Networks · IEEE Trans. Computers 2025
Electronic design automation
hardware verification and test
0.912025
Localizing Multiple Bugs in RTL Designs by Classifying Hit-Statements Using Neural Networks · IEEE Trans. Computers 2025
Electronic design automation › hardware verification and test › debugging
RTL debug
0.912025
Localizing Multiple Bugs in RTL Designs by Classifying Hit-Statements Using Neural Networks · IEEE Trans. Computers 2025

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

neural network · 0.9coverage data classification · 0.9
YearPublicationVenuePosition
2025 Localizing Multiple Bugs in RTL Designs by Classifying Hit-Statements Using Neural Networks
abstract
Nowadays the advanced applications required in our lives have led to a significant increase in the complexity of circuits, which enhances the possibility of occurring design errors. Hence an automated, powerful, and scalable debugging approach is needed. Therefore, this paper proposes a scalable approach for localizing multiple bugs in Register-Transfer level (RTL) designs by using neural networks. The main idea is that hit-statements which are covered by failed test-vectors are more suspicious than those covered by passed test-vectors. We use coverage data as samples of our data set, label these samples, and tune the neural network model. Then we encode hit-statements and give them to the tuned model as new samples. The model classifies hit-statements. Hit-statements that take the failed labels, labels related to the failed test-vectors, are more suspicious of containing bugs. The results demonstrate that the proposed methodology outperforms recent approaches Tarsel and CirFix by localizing 80% of bugs at Top-1. The results also imply that our methodology increases the F1-score metric by 1.13× in comparison with existing RTL debugging techniques, which are prediction-based.
Mahsa Heidari, Bijan Alizadeh
IEEE Trans. Computers1
2025 FixRTL: Auto-correction of Multiple RTL Bugs by a New Feature Burst Clustering Algorithm and Mutation
abstract
Existing debugging and correction approaches suffer from weaknesses such as scalability, reproducing new bugs, and lacking a strategy to deal with multiple bugs. Hence, this article proposes FixRTL, a fully automated scalable methodology for localizing and correcting multiple bugs in Register-Transfer level (RTL) designs. FixRTL consists of three phases: (1) Constructing Samples , (2) Debugging , and (3) Correction . First, we simulate the design under verification (DUV), extract coverage data, and construct our samples. Since we are looking for buggy hit-statements, we use the proposed feature burst (FB) clustering algorithm in the Debugging Phase . The algorithm applies samples as train data, categorizes the encoded hit-statements into bursts, and uses them as test data to predict their cluster. Then we rank hit-statements based on their probability of containing bugs per cluster. In the Correction Phase , we apply a proposed mutation-based framework to correct high-ranked hit-statements. The results show that FixRTL reduces the percentage of hit-statements that must be examined to localize bugs on average by 44.3%. The results also demonstrate that FixRTL corrects 67% of injected bugs while recent existing works correct up to 25%. Moreover, unlike recent works, FixRTL offers corrections that match the grand truth.
Mahsa Heidari, Bijan Alizadeh
ACM Trans. Design Autom. Electr. Syst.1