Approximation and decomposition of binary decision diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs....
Uloženo v:
| Vydáno v: | DAC 98: DAC: 35th Annual ACM/IEEE Design Automation Conference s. 445 - 450 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY, USA
ACM
01.01.1998
IEEE |
| Edice: | ACM Conferences |
| Témata: | |
| ISBN: | 0897919645, 9780897919647 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs. In this paper we present a new algorithm for approximation and analyze its performance in comparison with existing techniques. We also introduce a new decomposition algorithm that produces balanced partitions. The effectiveness of our contributions is demonstrated by improved results in reachability analysis for some hard problem instances. |
|---|---|
| AbstractList | Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs. In this paper we present a new algorithm for approximation and analyze its performance in comparison with existing techniques. We also introduce a new decomposition algorithm that produces balanced partitions. The effectiveness of our contributions is demonstrated by improved results in reachability analysis for some hard problem instances. |
| Author | Somenzi, Fabio McMillan, Kenneth L. Ravi, Kavita Shiple, Thomas R. |
| Author_xml | – sequence: 1 givenname: Kavita surname: Ravi fullname: Ravi, Kavita organization: University of Colorado – sequence: 2 givenname: Kenneth L. surname: McMillan fullname: McMillan, Kenneth L. organization: Cadence Design Systems – sequence: 3 givenname: Thomas R. surname: Shiple fullname: Shiple, Thomas R. organization: Synopsys – sequence: 4 givenname: Fabio surname: Somenzi fullname: Somenzi, Fabio organization: University of Colorado |
| BookMark | eNqFUD1PwzAUtARI0NKRhakTEy3-diymquJLqsQCs_UcvyBDE4e4lei_JyFIjLzlpLvTe-9uQo6b1CAhF4wuGZPqhhtDpVz2wHRxRCa0sMYyq6U6JbOc32k_UjFhizNyu2rbLn3FGnYxNXNowjxgmeo25fjDpGruYwPdYeBjHqgQ4a2DOp-Tkwq2GWe_OCWv93cv68fF5vnhab3aLEBItlsEBQq0LBUvqpIh9zyoygZeBA9Y6VIwbaUo0Av0lClBgYugvQ1oUAjhxZRcjXv7Tz_3mHeujrnE7RYaTPvsBJOSGaN74-VojIjo2q5P1R2c4UPYXrweRShr51P6yI5RNxTmxsLcWJjzXcTq7-g_dvENTu9sxg |
| ContentType | Conference Proceeding |
| Copyright | 1998 ACM |
| Copyright_xml | – notice: 1998 ACM |
| DBID | 6IE 6IH CBEJK RIE RIO 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/277044.277168 |
| 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 Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Editor | Irwin, M. J. |
| Editor_xml | – sequence: 1 givenname: M. J. surname: Irwin fullname: Irwin, M. J. |
| EndPage | 450 |
| ExternalDocumentID | 724513 |
| Genre | Conference Paper |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR ACGHX ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI OCL RIB RIC RIE RIL RIO AAWTH LHSKQ 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-a341t-d5a5a64c528fc1e2b2d5f9d28dbaef6c3169438eb3eb01530a23d6b9de7e333b3 |
| IEDL.DBID | RIE |
| ISBN | 0897919645 9780897919647 |
| ISICitedReferencesCount | 32 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000077273700080&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Fri Jul 11 01:26:34 EDT 2025 Tue Aug 26 17:47:23 EDT 2025 Wed Jan 31 06:44:47 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | digital radio ISM frequency band spread spectrum communication transceiver RF CMOS |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | DAC98: The 35th ACM/IEEE-CAS/EDAC Design Automation Conference |
| MergedId | FETCHMERGED-LOGICAL-a341t-d5a5a64c528fc1e2b2d5f9d28dbaef6c3169438eb3eb01530a23d6b9de7e333b3 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| OpenAccessLink | https://dl.acm.org/doi/pdf/10.1145/277044.277168 |
| PQID | 31441776 |
| PQPubID | 23500 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_277044_277168 ieee_primary_724513 acm_books_10_1145_277044_277168_brief proquest_miscellaneous_31441776 |
| PublicationCentury | 1900 |
| PublicationDate | 1998-01-01 |
| PublicationDateYYYYMMDD | 1998-01-01 |
| PublicationDate_xml | – month: 01 year: 1998 text: 1998-01-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | DAC 98: DAC: 35th Annual ACM/IEEE Design Automation Conference |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 1998 |
| Publisher | ACM IEEE |
| Publisher_xml | – name: ACM – name: IEEE |
| SSID | ssj0000451398 |
| Score | 1.703568 |
| Snippet | Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in... |
| SourceID | proquest ieee acm |
| SourceType | Aggregation Database Publisher |
| StartPage | 445 |
| SubjectTerms | Algorithm design and analysis Applied computing -- Physical sciences and engineering -- Engineering Approximation algorithms Binary decision diagrams Boolean functions Computer systems organization -- Dependable and fault-tolerant systems and networks Contracts Data structures General and reference -- Cross-computing tools and techniques -- Performance Hardware -- Integrated circuits Hardware -- Robustness Mathematics of computing -- Discrete mathematics Mathematics of computing -- Mathematical analysis -- Functional analysis -- Approximation Mathematics of computing -- Mathematical software Networks -- Network performance evaluation Partitioning algorithms Performance analysis Permission Reachability analysis Theory of computation -- Design and analysis of algorithms -- Approximation algorithms analysis |
| Title | Approximation and decomposition of binary decision diagrams |
| URI | https://ieeexplore.ieee.org/document/724513 https://www.proquest.com/docview/31441776 |
| WOSCitedRecordID | wos000077273700080&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmDiVUR5ZoAxbRy_YjEhRMVUdQCpm2XHZ6kDCeoD8fPxIy0DSIgpDyWR9fmU853v-w6hW2GAO1bQHBjwnFqjcyOYy3ltGRHYatAuNpsQk0k1m8lpp7MduTAAEIvPYBhO416-bet1SJWNRElZ6FC7KwRPVK1tOiXIpBBZRYVHKWSQmWKdvs7mWmwkNikblUIUlA79ASeR1fqta6_y458cHc344F9DPET9b8JeNt26oiO0A80Jun8IeuGf80ROzHRjMwuhhLyr08pal5lIxw33I8c889YSyrWWffQ6fnp5fM67Xgm59n5olVummea0ZmXlagylKS1z0paVRx8crwnmkpLKh85g_AqAFLoklhtpQQAhxJBT1GvaBs5QFlZBFGNjqSPU1ZWxuNAVLgiRhaaSDNCNh0uFIGCpEq-ZqQSoSoAO0N0fTyizmIMboOOAoHpPwhoqgee_v5kB5W09bGDoBtr1UpEQ_fm5P__1vQu0nwiDIT9yiXqrxRqu0F79sZovF9fRXL4AtIy5kg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5EBT35qlhfzUGPaZPsK4snEUvFWnqo0Nuym52FHkylacWf7-4mrQcF8ZQHmxC-HTI7s_N9g9AN18AsTUgMFFhMjFax5tTGrDAU89QoUDY0m-CjUT6dinGjsx24MAAQis-g60_DXr6ZFyufKuvxjFDfoXbHN85qyFqbhIoXSsEiDxqPggsvNEUbhZ31NV-LbBLayzhPCOm6Q1rLrBZvTYOVH3_l4Gr6B__6yEPU-qbsReONMzpCW1CeoLt7rxj-OavpiZEqTWTAF5E3lVrR3EY6EHL9_cAyj5y9-IKtqoVe-4-Th0HcdEuIlfNEy9hQRRUjBc1yW6SQ6cxQK0yWO_zBsgKnTBCcu-AZtFsD4ERl2DAtDHDAGGt8irbLeQlnKPLrIJKm2hCLiS1ybdJE5WmCsUgUEbiNOg4u6cOAStbMZiprQGUNaBvd_jFC6sUMbBsdewTley2tIWvw3PvXMyCdtfstDFXCfFVJ7OM_ztn5r8910N5g8jKUw6fR8wXar-mDPltyibaXixVcod3iYzmrFtfBdL4AkoK82w |
| 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=DAC+98%3A+DAC%3A+35th+Annual+ACM%2FIEEE+Design+Automation+Conference&rft.atitle=Approximation+and+decomposition+of+binary+decision+diagrams&rft.au=Ravi%2C+Kavita&rft.au=McMillan%2C+Kenneth+L&rft.au=Shiple%2C+Thomas+R&rft.au=Somenzi%2C+Fabio&rft.date=1998-01-01&rft.isbn=9780897919647&rft.spage=445&rft.epage=450&rft_id=info:doi/10.1145%2F277044.277168&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780897919647/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780897919647/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780897919647/sc.gif&client=summon&freeimage=true |