Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets
Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking. Based on an analysis of shared circuit structures we pre...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 943 |
|---|---|
| container_issue | |
| container_start_page | 938 |
| container_title | |
| container_volume | |
| creator | Disch, S. Scholl, C. |
| description | Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking. Based on an analysis of shared circuit structures we present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT approach seems to decrease. Experimental results demonstrate that our novel method outperforms traditional methods significantly. |
| doi_str_mv | 10.1109/ASPDAC.2007.358110 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4196156</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4196156</ieee_id><sourcerecordid>4196156</sourcerecordid><originalsourceid>FETCH-LOGICAL-i219t-be93c2316d500bd5b3b718992affa3019dd730d8faf1dc30094210a2e6feebd03</originalsourceid><addsrcrecordid>eNo9j1tLw0AQhVdUsNb-AX3ZH2DizG4u3ccQqxYKEdM-StlkJ7qabGsuBf-98YLn4Qzn4zBwGLtE8BFB3ST5422S-gIg9mU4H9kRO8dABAFEEuLj_yCUPGETgaH0IhXhGZt13RuMCkHECBP2nO6awjrd253TNV98DPaga3Il8fSVynfrXvim-_alK1tqyPVjLU_WPN_Vh5Ff82zo90PPs9ZQ-wO0M_yJOuq7C3Za6bqj2d-dss3dYp0-eKvsfpkmK88KVL1XkJKlkBiZEKAwYSGLGOdKCV1VWgIqY2IJZl7pCk0pAVQgELSgqCIqDMgpu_r9a4lou29to9vPbYDj5DCSX8zsVlM</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Disch, S. ; Scholl, C.</creator><creatorcontrib>Disch, S. ; Scholl, C.</creatorcontrib><description>Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking. Based on an analysis of shared circuit structures we present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT approach seems to decrease. Experimental results demonstrate that our novel method outperforms traditional methods significantly.</description><identifier>ISSN: 2153-6961</identifier><identifier>ISBN: 1424406293</identifier><identifier>ISBN: 9781424406296</identifier><identifier>EISBN: 1424406307</identifier><identifier>EISBN: 9781424406302</identifier><identifier>DOI: 10.1109/ASPDAC.2007.358110</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Boolean functions ; Circuit analysis ; Circuit synthesis ; Computer science ; Context modeling ; Logic circuits ; State-space methods ; Tin ; Very large scale integration</subject><ispartof>2007 Asia and South Pacific Design Automation Conference, 2007, p.938-943</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4196156$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4196156$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Disch, S.</creatorcontrib><creatorcontrib>Scholl, C.</creatorcontrib><title>Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets</title><title>2007 Asia and South Pacific Design Automation Conference</title><addtitle>ASPDAC</addtitle><description>Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking. Based on an analysis of shared circuit structures we present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT approach seems to decrease. Experimental results demonstrate that our novel method outperforms traditional methods significantly.</description><subject>Application software</subject><subject>Boolean functions</subject><subject>Circuit analysis</subject><subject>Circuit synthesis</subject><subject>Computer science</subject><subject>Context modeling</subject><subject>Logic circuits</subject><subject>State-space methods</subject><subject>Tin</subject><subject>Very large scale integration</subject><issn>2153-6961</issn><isbn>1424406293</isbn><isbn>9781424406296</isbn><isbn>1424406307</isbn><isbn>9781424406302</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9j1tLw0AQhVdUsNb-AX3ZH2DizG4u3ccQqxYKEdM-StlkJ7qabGsuBf-98YLn4Qzn4zBwGLtE8BFB3ST5422S-gIg9mU4H9kRO8dABAFEEuLj_yCUPGETgaH0IhXhGZt13RuMCkHECBP2nO6awjrd253TNV98DPaga3Il8fSVynfrXvim-_alK1tqyPVjLU_WPN_Vh5Ff82zo90PPs9ZQ-wO0M_yJOuq7C3Za6bqj2d-dss3dYp0-eKvsfpkmK88KVL1XkJKlkBiZEKAwYSGLGOdKCV1VWgIqY2IJZl7pCk0pAVQgELSgqCIqDMgpu_r9a4lou29to9vPbYDj5DCSX8zsVlM</recordid><startdate>200701</startdate><enddate>200701</enddate><creator>Disch, S.</creator><creator>Scholl, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200701</creationdate><title>Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets</title><author>Disch, S. ; Scholl, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i219t-be93c2316d500bd5b3b718992affa3019dd730d8faf1dc30094210a2e6feebd03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Application software</topic><topic>Boolean functions</topic><topic>Circuit analysis</topic><topic>Circuit synthesis</topic><topic>Computer science</topic><topic>Context modeling</topic><topic>Logic circuits</topic><topic>State-space methods</topic><topic>Tin</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Disch, S.</creatorcontrib><creatorcontrib>Scholl, C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Disch, S.</au><au>Scholl, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets</atitle><btitle>2007 Asia and South Pacific Design Automation Conference</btitle><stitle>ASPDAC</stitle><date>2007-01</date><risdate>2007</risdate><spage>938</spage><epage>943</epage><pages>938-943</pages><issn>2153-6961</issn><isbn>1424406293</isbn><isbn>9781424406296</isbn><eisbn>1424406307</eisbn><eisbn>9781424406302</eisbn><abstract>Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in bounded model checking. Based on an analysis of shared circuit structures we present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT approach seems to decrease. Experimental results demonstrate that our novel method outperforms traditional methods significantly.</abstract><pub>IEEE</pub><doi>10.1109/ASPDAC.2007.358110</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2153-6961 |
| ispartof | 2007 Asia and South Pacific Design Automation Conference, 2007, p.938-943 |
| issn | 2153-6961 |
| language | eng |
| recordid | cdi_ieee_primary_4196156 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Application software Boolean functions Circuit analysis Circuit synthesis Computer science Context modeling Logic circuits State-space methods Tin Very large scale integration |
| title | Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T13%3A13%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Combinational%20Equivalence%20Checking%20Using%20Incremental%20SAT%20Solving,%20Output%20Ordering,%20and%20Resets&rft.btitle=2007%20Asia%20and%20South%20Pacific%20Design%20Automation%20Conference&rft.au=Disch,%20S.&rft.date=2007-01&rft.spage=938&rft.epage=943&rft.pages=938-943&rft.issn=2153-6961&rft.isbn=1424406293&rft.isbn_list=9781424406296&rft_id=info:doi/10.1109/ASPDAC.2007.358110&rft_dat=%3Cieee_6IE%3E4196156%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424406307&rft.eisbn_list=9781424406302&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4196156&rfr_iscdi=true |