X-SAT: An Efficient Circuit-Based SAT Solver
In modern digital circuit design, verifying the equivalence of arithmetic circuits is a significant and challenging task. This paper introduces a new circuit solver based on the Conflict-Driven Clause Learning (CDCL) algorithm, which integrates structural elimination techniques to reduce the number...
Saved in:
| Published in: | 2025 62nd ACM/IEEE Design Automation Conference (DAC) pp. 1 - 7 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
22.06.2025
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In modern digital circuit design, verifying the equivalence of arithmetic circuits is a significant and challenging task. This paper introduces a new circuit solver based on the Conflict-Driven Clause Learning (CDCL) algorithm, which integrates structural elimination techniques to reduce the number of variables and clauses while maintaining the circuit structure. Additionally, branching heuristics have been enhanced specifically for the structure of arithmetic circuits. Experimental results demonstrate that X-SAT significantly outperforms best previous circuit solver could be found on all benchmarks. Further, X-SAT performs better than the state-of-the-art CNF-based SAT solvers on complex arithmetic circuits, underscoring its significant potential in the field of circuit design verification. |
|---|---|
| AbstractList | In modern digital circuit design, verifying the equivalence of arithmetic circuits is a significant and challenging task. This paper introduces a new circuit solver based on the Conflict-Driven Clause Learning (CDCL) algorithm, which integrates structural elimination techniques to reduce the number of variables and clauses while maintaining the circuit structure. Additionally, branching heuristics have been enhanced specifically for the structure of arithmetic circuits. Experimental results demonstrate that X-SAT significantly outperforms best previous circuit solver could be found on all benchmarks. Further, X-SAT performs better than the state-of-the-art CNF-based SAT solvers on complex arithmetic circuits, underscoring its significant potential in the field of circuit design verification. |
| Author | Zhang, Xindi Qian, Yuhang Chen, Zhihan Cai, Shaowei |
| Author_xml | – sequence: 1 givenname: Yuhang surname: Qian fullname: Qian, Yuhang email: qianyh@ios.ac.cn organization: Institute of Software, Chinese Academy of Sciences,Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science – sequence: 2 givenname: Zhihan surname: Chen fullname: Chen, Zhihan email: chenzh@ios.ac.cn organization: Institute of Software, Chinese Academy of Sciences,Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science – sequence: 3 givenname: Xindi surname: Zhang fullname: Zhang, Xindi email: zhangxd@ios.ac.cn organization: Institute of Software, Chinese Academy of Sciences,Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science – sequence: 4 givenname: Shaowei surname: Cai fullname: Cai, Shaowei email: caisw@ios.ac.cn organization: Institute of Software, Chinese Academy of Sciences,Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science |
| BookMark | eNo1j91KAzEQRiPohda-gUgewNSZTJpsvFvX-gMFL1rBuzKbnUCgbmW7Cr69BevVB-fAge9Cnfa7XpS6RpghQrx9qBtPlYszC3Z-QEjWgztR0xhiRYRzIHDVubp5N6t6fafrXi9yLqlIP-qmDOmrjOae99Lpg9er3fZbhkt1lnm7l-lxJ-rtcbFuns3y9emlqZeGMcTRVInBYReFKVrukm9joIzgU5uch8gCIKGFwDnZzODb5D1lsjkEB-hooq7-ukVENp9D-eDhZ_N_gn4BkuQ-fw |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/DAC63849.2025.11132604 |
| 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 | 11132604 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Chinese Academy of Sciences funderid: 10.13039/501100002367 |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-a179t-8ca041d9ea392adc6b973f106cbc4609ae00e7b07afc2fa06bc663f32f7740143 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 01 07:05:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a179t-8ca041d9ea392adc6b973f106cbc4609ae00e7b07afc2fa06bc663f32f7740143 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_11132604 |
| 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.3089225 |
| Snippet | In modern digital circuit design, verifying the equivalence of arithmetic circuits is a significant and challenging task. This paper introduces a new circuit... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Arithmetic Benchmark testing Boolean satisfiability Circuit synthesis Circuit-based SAT Circuits Design automation Digital circuits EDA Equivalence checking Logic gates Performance gain Robustness |
| Title | X-SAT: An Efficient Circuit-Based SAT Solver |
| URI | https://ieeexplore.ieee.org/document/11132604 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwMhECbaePURa3yHg0dpWWBh11utbTyYpklrsrcGBkh62Zq69fcX6FbjwYMXQniG58zAfDMIPVgplZY2I7lVmgjDS1Iw7wnPvc445AJsMpn_piaToqrKaQtWT1gY51xSPnO9GE1_-XYFm_hU1k9u0WW0_nmolNyBtVrUb0bL_stgGHaTiPATlvf2hX-5TUlUY3zyz_5OUfcHf4en35TlDB24-hw9VmQ2mD_hQY1Hye5DqIuHyzVslg15DsTI4pCPZ6uo69xF7-PRfPhKWl8HRIcj0ZACNBWZLZ0ODIu2IE2puA_yGhgQkpbaUeqUoUp7YF5TaSDwCp4zr6JPPcEvUKde1e4SYcOBWerDzcFA5EGgAqqtyIwoTGgns1eoG4e6-NiZs1jsR3n9R_oNOmZxRmMQlaQYu0WdZr1xd-gIvprl5_o-rcQWD6OIDg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4MmuhJjRjf9uDRQrfbbXe9IUIwIiEBE26knbYJl4Xg4u-3rYvGgwdvTZ_pczrtfPMhdGeEkEqYhGRGKsJ1WpCcOUfSzKkkhYyDiS7zh3I0ymezYlyD1SMWxlobjc9sKwTjX75ZwiY8lbUjLboI3j93A3VWDdeqcb8JLdpPna5fTzwAUFjW2mb_RZwS5Ub_8J8tHqHmDwIPj79lyzHaseUJup-RSWf6gDsl7kXPD74s7i7WsFlU5NGLI4N9Op4sg7VzE731e9PugNRsB0T5TVGRHBTliSms8lcWZUDoQqbOa2yggQtaKEuplZpK5YA5RYUGf1twKXMysOrx9BQ1ymVpzxDWKTBDnT87GPDMq1RAleGJ5rn29STmHDVDV-erL4cW820vL_6Iv0X7g-nrcD58Hr1cooMwuMFairEr1KjWG3uN9uCjWryvb-KEfAKvhIpa |
| 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=X-SAT%3A+An+Efficient+Circuit-Based+SAT+Solver&rft.au=Qian%2C+Yuhang&rft.au=Chen%2C+Zhihan&rft.au=Zhang%2C+Xindi&rft.au=Cai%2C+Shaowei&rft.date=2025-06-22&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FDAC63849.2025.11132604&rft.externalDocID=11132604 |