BoolE: Exact Symbolic Reasoning via Boolean Equality Saturation

Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically, reasoning datapath and adder tree in bit-blasted Boolean networks is particularly crucial for verification and synthesis, and challenging. Convent...

Full description

Saved in:
Bibliographic Details
Published in:2025 62nd ACM/IEEE Design Automation Conference (DAC) pp. 1 - 7
Main Authors: Yin, Jiaqi, Song, Zhan, Chen, Chen, Hu, Qihao, Yu, Cunxi
Format: Conference Proceeding
Language:English
Published: IEEE 22.06.2025
Subjects:
Adders
Cognition
Formal verification
Hardware security
Learning systems
Logic gates
Machine learning algorithms
Optimization
Runtime
Scalability
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically, reasoning datapath and adder tree in bit-blasted Boolean networks is particularly crucial for verification and synthesis, and challenging. Conventional approaches either fail to accurately (exactly) identify the function blocks of the designs in gate-level netlist with structural hashing and symbolic propagation, or their reasoning performance is highly sensitive to structure modifications caused by technology mapping or logic optimization. This paper introduces BoolE, an exact symbolic reasoning framework for Boolean netlists using equality saturation. BoolE optimizes scalability and performance by integrating domain-specific Boolean ruleset for term rewriting. We incorporate a novel extraction algorithm into BoolE to enhance its structural insight and computational efficiency, which adeptly identifies and captures multi-input, multi-output high-level structures (e.g., full adder) in the reconstructed e-graph. Our experiments show that BoolE surpasses state-of-the-art symbolic reasoning baselines, including the conventional functional approach (ABC) and machine learning-based method (Gamora). Specifically, we evaluated its performance on various multiplier architecture with different configurations. Our results show that BoolE identifies 3.53 \times and 3.01 \times more exact full adders than ABC in carry-save array and Booth-encoded multipliers, respectively. Additionally, we integrated BoolE into multiplier formal verification tasks, where it significantly accelerates the performance of traditional formal verification tools using computer algebra, demonstrated over four orders of magnitude runtime improvements.
AbstractList Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically, reasoning datapath and adder tree in bit-blasted Boolean networks is particularly crucial for verification and synthesis, and challenging. Conventional approaches either fail to accurately (exactly) identify the function blocks of the designs in gate-level netlist with structural hashing and symbolic propagation, or their reasoning performance is highly sensitive to structure modifications caused by technology mapping or logic optimization. This paper introduces BoolE, an exact symbolic reasoning framework for Boolean netlists using equality saturation. BoolE optimizes scalability and performance by integrating domain-specific Boolean ruleset for term rewriting. We incorporate a novel extraction algorithm into BoolE to enhance its structural insight and computational efficiency, which adeptly identifies and captures multi-input, multi-output high-level structures (e.g., full adder) in the reconstructed e-graph. Our experiments show that BoolE surpasses state-of-the-art symbolic reasoning baselines, including the conventional functional approach (ABC) and machine learning-based method (Gamora). Specifically, we evaluated its performance on various multiplier architecture with different configurations. Our results show that BoolE identifies 3.53 \times and 3.01 \times more exact full adders than ABC in carry-save array and Booth-encoded multipliers, respectively. Additionally, we integrated BoolE into multiplier formal verification tasks, where it significantly accelerates the performance of traditional formal verification tools using computer algebra, demonstrated over four orders of magnitude runtime improvements.
Author Hu, Qihao
Chen, Chen
Yin, Jiaqi
Song, Zhan
Yu, Cunxi
Author_xml – sequence: 1
  givenname: Jiaqi
  surname: Yin
  fullname: Yin, Jiaqi
  email: jyin629@umd.edu
  organization: University of Maryland, College Park,College Park,US
– sequence: 2
  givenname: Zhan
  surname: Song
  fullname: Song, Zhan
  organization: University of Maryland, College Park,College Park,US
– sequence: 3
  givenname: Chen
  surname: Chen
  fullname: Chen, Chen
  organization: University of Maryland, College Park,College Park,US
– sequence: 4
  givenname: Qihao
  surname: Hu
  fullname: Hu, Qihao
  organization: University of Maryland, College Park,College Park,US
– sequence: 5
  givenname: Cunxi
  surname: Yu
  fullname: Yu, Cunxi
  email: cunxiyu@umd.edu
  organization: University of Maryland, College Park,College Park,US
BookMark eNo1j81KAzEUhSPoQmvfQCQvMDXJTZrEjdRx_IGCYHVdbmYSCUwTnabivH0r6urA4ePwnTNynHLyhFxyNuOc2au7RT0HI-1MMKEOFQehhTkiU6utAeCKAZPmlNzc5tw317T5xrbQ1bhxuY8tffG4zSmmd_oVkf4wHhNtPnfYxzLSFZbdgCXmdE5OAvZbP_3LCXm7b17rx2r5_PBUL5YVcm1LJUOLoXOKq64zwlnNNRhvrQIemETOUKHqQusAJILsDm4MBZq5FQ59QJiQi9_d6L1ffwxxg8O4_v8Fe4OYR08
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/DAC63849.2025.11132728
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798331503048
EndPage 7
ExternalDocumentID 11132728
Genre orig-research
GrantInformation_xml – fundername: National Science Foundation
  funderid: 10.13039/100000001
GroupedDBID 6IE
6IH
CBEJK
RIE
RIO
ID FETCH-LOGICAL-a179t-4fcafdb515dd82b971738e99531f04a10a5a5dfcb334a34d0480a2a8692baefa3
IEDL.DBID RIE
IngestDate Wed Oct 01 07:05:15 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a179t-4fcafdb515dd82b971738e99531f04a10a5a5dfcb334a34d0480a2a8692baefa3
PageCount 7
ParticipantIDs ieee_primary_11132728
PublicationCentury 2000
PublicationDate 2025-June-22
PublicationDateYYYYMMDD 2025-06-22
PublicationDate_xml – month: 06
  year: 2025
  text: 2025-June-22
  day: 22
PublicationDecade 2020
PublicationTitle 2025 62nd ACM/IEEE Design Automation Conference (DAC)
PublicationTitleAbbrev DAC
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
Score 2.3156593
Snippet Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically,...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Adders
Cognition
Formal verification
Hardware security
Learning systems
Logic gates
Machine learning algorithms
Optimization
Runtime
Scalability
Title BoolE: Exact Symbolic Reasoning via Boolean Equality Saturation
URI https://ieeexplore.ieee.org/document/11132728
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LSwMxEICDLR48qVjxTQ5et93dZDeJF9G6xYOUYhV6K5MXFHRX2m2x_94k2yoePEguIRkImSTkMflmELpOhMqJS1GsLYuocRdWIWwWgasgPFdG8QAKP7HhkE8mYrSB1QMLY4wJn89M12eDLV9XaumfynohLDpLeQu1GMsbWGtD_Sax6D3c9d1soh4_SbPuVvhX2JSwawz2_9neAer88Hd49L2zHKIdUx6h2_uqeitucPEJqsbj9bv0Ln3xs4FFeFLFqxlgL2OgxEUDS67x2DvuDNrvoNdB8dJ_jDbhD5yimKgjahVYLd2BQ2ueSuHt5dwI4VaNjSkkMWSQaaskIRQI1Z4OhxR4LlIJxgI5Ru2yKs0JwiLx8tYNhSRUai00BQZaQKKU1oSfoo7v_fSj8XAx3Xb87I_yc7Tndey_TKXpBWrX86W5RLtqVc8W86swLl-4gZBo
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LSwMxEICDVkFPKlZ8m4PXbXeTbDfxIlq3VKyl2Aq9ldk8oKC70m6L_fcmaat48CC5hGQgZJKQx-SbQeg6ErJBbQpCZZKAaXthFcLEAdgKyhtSS-5B4U7S7fLhUPRWsLpnYbTW_vOZrrmst-WrQs7cU1ndh0VPCN9EWzFjJFziWivuNwpF_eGuaecTcwAKiWtr8V-BU_y-0dr7Z4v7qPpD4OHe995ygDZ0fohu74viLb3B6SfIEvcX75lz6otfNEz9oyqejwE7GQ05Tpe45AL3netOr_8qem2lg2Y7WAVAsKpKRBkwI8GozB45lOIkE85izrUQdt2YkEEUQgyxMjKjlAFlyvHhQIA3BMlAG6BHqJIXuT5GWERO3tjByCjLlBKKQQJKQCSlUpSfoKrr_ehj6eNitO746R_lV2inPXjujDqP3acztOv07T5QEXKOKuVkpi_QtpyX4-nk0o_RF2wjk68
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+62nd+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=BoolE%3A+Exact+Symbolic+Reasoning+via+Boolean+Equality+Saturation&rft.au=Yin%2C+Jiaqi&rft.au=Song%2C+Zhan&rft.au=Chen%2C+Chen&rft.au=Hu%2C+Qihao&rft.date=2025-06-22&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FDAC63849.2025.11132728&rft.externalDocID=11132728