activity
20242026
most citedE-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesis

1 citations · 2 across the 15 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.LO2025

ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers

Chen Chen, Daniela Kaufmann, Chenhui Deng +3

We present ReVEAL, a graph-learning-based method for reverse engineering of multiplier architectures to improve algebraic circuit verification techniques. Our framework leverages s…

cs.LO2025

Functional Reduction to Speed Up Bounded Model Checking

Changyuan Yu, Wenbin Che, Hongce Zhang

Bounded model checking (BMC) is a widely used technique for formal property verification (FPV), where the transition relation is repeatedly unrolled to increasing depths and encode…

cs.AR2025

BDD2Seq: Enabling Scalable Reversible-Circuit Synthesis via Graph-to-Sequence Learning

Mingkai Miao, Jianheng Tang, Guangyu Hu +1

Binary Decision Diagrams (BDDs) are instrumental in many electronic design automation (EDA) tasks thanks to their compact representation of Boolean functions. In BDD-based reversib…

cs.LO2025

FORWORD: Accelerating Formal Datapath Verification via Word-Level Sweeping

Ziyi Yang, Guangyu Hu, Xiaofeng Zhou +4

Modern circuit design process increasingly adopts high-level hardware construction languages and parameterized design methodologies to shorten development cycles and maintain high…

cs.AR2025★ 1 cited

E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesis

Chen Chen, Guangyu HU, Cunxi Yu +2

In technology mapping, the quality of the final implementation heavily relies on the circuit structure after technology-independent optimization. Recent studies have introduced equ…