Path verification using Boolean satisfiability
The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on Boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circ...
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 | 966 |
|---|---|
| container_issue | |
| container_start_page | 965 |
| container_title | |
| container_volume | |
| creator | Ringe, M. Lindenkreuz, T. Barke, E. |
| description | The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on Boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time. |
| doi_str_mv | 10.1109/DATE.1998.655991 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_655991</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>655991</ieee_id><sourcerecordid>655991</sourcerecordid><originalsourceid>FETCH-LOGICAL-i174t-7ea60706a3222b0da9436d1d9c1cfc04d154e101729fa8a98dd049d5238e19c03</originalsourceid><addsrcrecordid>eNotj0tLw0AURgdEUGr24ip_IPHeed9lrfUBBV3UdbmdmehITCQThf57C_XbHDiLA58Q1wgtItDt_XK7bpHIt9YYIjwTFTkPHr31ypC9EFUpn3CcIo3WXIr2leeP-jdNucuB5zwO9U_Jw3t9N4594qEuR1m6zPvc5_lwJc477kuq_rkQbw_r7eqp2bw8Pq-Wmyaj03PjEltwYFlJKfcQmbSyESMFDF0AHdHohIBOUseeyccImqKRyiekAGohbk7dnFLafU_5i6fD7nRK_QGCXUFG</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Path verification using Boolean satisfiability</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ringe, M. ; Lindenkreuz, T. ; Barke, E.</creator><creatorcontrib>Ringe, M. ; Lindenkreuz, T. ; Barke, E.</creatorcontrib><description>The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on Boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.</description><identifier>ISBN: 9780818683596</identifier><identifier>ISBN: 0818683597</identifier><identifier>DOI: 10.1109/DATE.1998.655991</identifier><language>eng</language><publisher>IEEE</publisher><subject>Benchmark testing ; Combinational circuits ; Data structures ; Delay ; Design automation ; Integrated circuit interconnections ; Microelectronics ; Pins ; Sun ; Timing</subject><ispartof>Proceedings Design, Automation and Test in Europe, 1998, p.965-966</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/655991$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/655991$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ringe, M.</creatorcontrib><creatorcontrib>Lindenkreuz, T.</creatorcontrib><creatorcontrib>Barke, E.</creatorcontrib><title>Path verification using Boolean satisfiability</title><title>Proceedings Design, Automation and Test in Europe</title><addtitle>DATE</addtitle><description>The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on Boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.</description><subject>Benchmark testing</subject><subject>Combinational circuits</subject><subject>Data structures</subject><subject>Delay</subject><subject>Design automation</subject><subject>Integrated circuit interconnections</subject><subject>Microelectronics</subject><subject>Pins</subject><subject>Sun</subject><subject>Timing</subject><isbn>9780818683596</isbn><isbn>0818683597</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj0tLw0AURgdEUGr24ip_IPHeed9lrfUBBV3UdbmdmehITCQThf57C_XbHDiLA58Q1wgtItDt_XK7bpHIt9YYIjwTFTkPHr31ypC9EFUpn3CcIo3WXIr2leeP-jdNucuB5zwO9U_Jw3t9N4594qEuR1m6zPvc5_lwJc477kuq_rkQbw_r7eqp2bw8Pq-Wmyaj03PjEltwYFlJKfcQmbSyESMFDF0AHdHohIBOUseeyccImqKRyiekAGohbk7dnFLafU_5i6fD7nRK_QGCXUFG</recordid><startdate>1998</startdate><enddate>1998</enddate><creator>Ringe, M.</creator><creator>Lindenkreuz, T.</creator><creator>Barke, E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1998</creationdate><title>Path verification using Boolean satisfiability</title><author>Ringe, M. ; Lindenkreuz, T. ; Barke, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i174t-7ea60706a3222b0da9436d1d9c1cfc04d154e101729fa8a98dd049d5238e19c03</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Benchmark testing</topic><topic>Combinational circuits</topic><topic>Data structures</topic><topic>Delay</topic><topic>Design automation</topic><topic>Integrated circuit interconnections</topic><topic>Microelectronics</topic><topic>Pins</topic><topic>Sun</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Ringe, M.</creatorcontrib><creatorcontrib>Lindenkreuz, T.</creatorcontrib><creatorcontrib>Barke, E.</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>Ringe, M.</au><au>Lindenkreuz, T.</au><au>Barke, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Path verification using Boolean satisfiability</atitle><btitle>Proceedings Design, Automation and Test in Europe</btitle><stitle>DATE</stitle><date>1998</date><risdate>1998</risdate><spage>965</spage><epage>966</epage><pages>965-966</pages><isbn>9780818683596</isbn><isbn>0818683597</isbn><abstract>The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on Boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.</abstract><pub>IEEE</pub><doi>10.1109/DATE.1998.655991</doi><tpages>2</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780818683596 |
| ispartof | Proceedings Design, Automation and Test in Europe, 1998, p.965-966 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_655991 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Benchmark testing Combinational circuits Data structures Delay Design automation Integrated circuit interconnections Microelectronics Pins Sun Timing |
| title | Path verification using Boolean satisfiability |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T02%3A25%3A28IST&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=Path%20verification%20using%20Boolean%20satisfiability&rft.btitle=Proceedings%20Design,%20Automation%20and%20Test%20in%20Europe&rft.au=Ringe,%20M.&rft.date=1998&rft.spage=965&rft.epage=966&rft.pages=965-966&rft.isbn=9780818683596&rft.isbn_list=0818683597&rft_id=info:doi/10.1109/DATE.1998.655991&rft_dat=%3Cieee_6IE%3E655991%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=655991&rfr_iscdi=true |