- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2(+1)
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
This paper proposes a GNN learning framework to predict a subgraph with shared logic of a post-synthesis netlist. This is generally an interesting direction, and I have seen related work in the community. But I have several concerns about the problem formulation and the application's meaning.
Critical strengths
Prediction of functional subgraphs with shared logic is a promising research direction in EDA. I appreciate the authors' efforts to utilize GNNs to address the challenging prediction problem.
Critical weaknesses
-
The problem formulation is unclear. I have a big concern about the meaning and effectiveness of the method. I found the problem formulation scattered throughout the paper. As a result, I find it hard to understand the task setting. For example, is the input
a single netlistora pair {netlist, RTL}? The paper formulates the task as agate-level annotation task, so how it deals with the scenario whereone gateis shared withseveral different functional subgraphsremains unclear. The unclear problem formulation also raises a significant concern about the meaning of such an application, becausecommercial EDA toolsalready support substantial parts of similar requirements. For example:Synopsys Formality: RTL–netlist correlation, equivalent-net matching, and synthesis guidance covering transformations such as multiplier architecturesCadence Conformal supports RTL-to-gate equivalence checking, including complex arithmetic logic and datapaths.Synopsys VC Formal Datapath Validation supports arithmetic datapaths and reference-model-based checking.It would be helpful if the author could clearly distinguish between the tasks resolved by commercial tools and the remaining gap that necessitates GNN-based prediction. GNN-based prediction cannot guarantee 100% accuracy, which always raises concerns about the reliability of circuit design. As a result, if such applications can largely be resolved with off-the-shelf commercial formal verification tools, the value of GNN-based methodology will be significantly weakened. -
The contribution and novelty of the method are not clearly introduced. The authors list three contributions at the end of the introduction: (1) a problem formulation, (2) a network with simulation-based checks, and (3) evaluation on public benchmarks. Contribution (1) is problematic since it conflicts with the scenario where one gate is shared across different functional subgraphs. The most important contribution should be around (2), the training framework, which combines recognition with verification-driven refinement. What is
verification-driven refinement? Why does such a VDR process contribute to better prediction performance? -
The writing quality is low. The manuscript appears to be mainly AI-generated, and many presentations are ambiguous and hard to understand, which significantly hinders an effective evaluation of the paper's contributions.
Questions for authors
- I would appreciate a clear introduction to the background, including how this problem is addressed by commercial verification tools, and why it still remains challenging and necessitates GNN-based learning methods.
- Can you clarify the problem formulation, especially what the input to the model is? Is the input
a single netlistora pair {netlist, RTL}? - Can you clarify what '' verification-driven refinement '' is? Why does this VDR process improve prediction performance? Is there any challenge that prevents the general GNN-based learning method from working for the task?
4 comments
Follow-up on task formulation and verification-driven refinement
Dear Reviewer UdJf,
Thank you again for highlighting the need for a clearer task formulation and explanation of verification-driven refinement. We would appreciate your feedback on our November 15 response before discussion closes on November 18.
Our response explains the single-netlist input, overlapping region membership, and the distinction between region identification and equivalence checking. It also describes simulation-based refinement and the separate formal equivalence checks, with pointers to Sections 2.2, 2.3, and 3.3.
Please let us know of any remaining concerns about the task setting or verification procedure so we can clarify them. If the response and revision resolve your main concerns, we would appreciate an updated assessment and rating reflecting these clarifications.
Thank you for your time and consideration.
Best regards, The Authors
Gentle follow-up before the discussion closes
Dear Reviewer UdJf,
Thank you again for your time and careful review. With the discussion period ending on November 18, we would be grateful for your feedback on our November 15 response.
Our response covers the single-netlist input, shared-gate membership, and the role of verification-driven refinement. Please let us know of any remaining concerns so we can clarify them before discussion closes.
We appreciate your consideration of the response and revised manuscript in your final assessment.
Best regards, The Authors
Response
Dear authors, Thanks very much for your response to my questions. I have noticed the modifications to the paper, which actually provide meaningful clarifications, and I am able to understand your tasks and formulations better. However, the modifications to the original paper seem excessive and almost rewrite the introduction and motivation sections. I think this might be a concern, as it substantially rewrites a majority of the original manuscript. But considering the author's efforts, I decided to raise my score to 3 (weak accept).
Response to Reviewer UdJf
We thank the reviewer for seeing functional subgraph prediction under shared logic as a promising direction in EDA. The revision states the problem formulation in one place (Section 2.3) and positions the work against commercial equivalence checking (Section 2.2 and Appendix O).
[W1, Q1] How do commercial tools address this problem, and why is a GNN needed?
Response.Commercial tools solve a fundamentally different problem and cannot replace region identification. Tools like Formality, Conformal, and VC Formal are equivalence checkers that verify whether a netlist matches its RTL. They cannot answer "which gates implement which operation?", nor can they run without RTL, such as for third-party IP or legacy designs. Even with RTL, overlapping logic remains highly intractable for them. When synthesis merges operations of several bit widths into a datapath, the internal correspondence points disappear, often causing equivalence checking on such circuits to fail. Knowing the region of each operation is exactly what makes these checks tractable, which is the goal of our task.
A GNN is needed because traditional template matching fails after synthesis. Template matching relies on fixed stored patterns, but synthesis generates countless structurally different implementations for the same operation. Furthermore, shared logic breaks this approach entirely: a shared gate belongs to two operations at once, so neither operation appears as a complete structural match. A GNN solves this by learning from synthesized examples to infer a gate's function from its context, making it robust to both structural changes and overlapping logic. We have added this background to Sections 1 and 2.2..
[W1, Q2] Is the input a single netlist or a pair {netlist, RTL}?
Response. The input is a single gate-level netlist. No RTL is needed. ShareGate also uses a fixed library of generic reference functions (adder, subtractor, multiplier, comparator), which is the same for every netlist.
The output is one class for each gate, together with the region of every certified arithmetic core. A gate shared by several operations receives one class label and is included in the region of every core that uses it, so sharing is represented by the regions. We have gathered the formulation in Section 2.3 and added the input, the output and the treatment of shared gates to Definition 2.
[W2, Q3] What is verification-driven refinement, why does it improve prediction, and what prevents a general GNN from working?
VDR verifies each region proposed by the GNN through simulation, retaining a label only if the region passes the check. It applies the same 64 random input patterns to both the proposed region and a reference function—for instance, a 40-bit adder. If the outputs match for every pattern, the gates within that region are assigned the corresponding class; otherwise, the proposal is either revised or discarded. The complete, closed regions generated by VDR can ultimately be fed into a SAT/Miter solver for 100% rigorous formal equivalence verification (a process successfully completed for all 84 out of 84 cases, as detailed in Appendix K.7).
A general GNN faces two obstacles on this task. First, it labels a gate from its neighbors, and the neighbors of a shared gate belong to two operations, so the prediction there is ambiguous. Second, per-gate labels do not form a complete region that can be verified: regions taken directly from the classifier output are certified in 0 cases, against 252 of 252 after VDR. VDR improves prediction because it corrects labels with the function of a whole region, which the GNN cannot see. On the same classifier output it adds 20.9 to 32.3 MCC points over label smoothing (Table 2). This also answers the reliability concern: a GNN prediction is only a proposal, and no region is reported without passing a functional check.
[W3] Writing quality.
We have rewritten the introduction, Section 2.3 and Section 3.3 for clarity.