9 citations · 14 across the 7 of their papers we have counts for
7 papers
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
Joseph Cotnareanu, Zhanguang Zhang, Hui-Ling Zhen +2
Efficiently determining the satisfiability of a boolean equation -- known as the SAT problem for brevity -- is crucial in various industrial problems. Recently, the advent of deep…
IB-Net: Initial Branch Network for Variable Decision in Boolean Satisfiability
Tsz Ho Chan, Wenyi Xiao, Junhua Huang +3
Boolean Satisfiability problems are vital components in Electronic Design Automation, particularly within the Logic Equivalence Checking process. Currently, SAT solvers are employe…
BetterV: Controlled Verilog Generation with Discriminative Guidance
Zehua Pei, Hui-Ling Zhen, Mingxuan Yuan +2
Due to the growing complexity of modern Integrated Circuits (ICs), there is a need for automated circuit design methods. Recent years have seen rising research in hardware design l…
Machine Learning Insides OptVerse AI Solver: Design Principles and Applications
Xijun Li, Fangzhou Zhu, Hui-Ling Zhen +23
In an era of digital ubiquity, efficient resource management and decision-making are paramount across numerous industries. To this end, we present a comprehensive study on the inte…
DeepGate2: Functionality-Aware Circuit Representation Learning
Zhengyuan Shi, Hongyang Pan, Sadaf Khan +7
Circuit representation learning aims to obtain neural representations of circuit elements and has emerged as a promising research direction that can be applied to various EDA and l…
Conflict-driven Structural Learning Towards Higher Coverage Rate in ATPG
Hui-Ling Zhen, Naixing Wang, Junhua Huang +3
Due to the increasing challenges posed by the relentless rise in the design complexity of integrated circuits, Boolean Satisfiability (SAT) has emerged as a robust alternative to s…