Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits

Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Boubekeur, M., Schellekens, M.P.
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 286
container_issue
container_start_page 283
container_title
container_volume
creator Boubekeur, M.
Schellekens, M.P.
description Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This paper presents dedicated techniques for optimization of formal verification of asynchronous circuits, these include for instance: automata reduction, pre-order reduction and automatic abstraction. All these techniques have been implemented and tested in a formal verification environment.
doi_str_mv 10.1109/ICECS.2007.4510985
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4510985</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4510985</ieee_id><sourcerecordid>4510985</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-235c726e2d07690a4f824daa8f874a2981f4106e3df810b76d64d55cac837d7b3</originalsourceid><addsrcrecordid>eNpFUMtKAzEAjEhBW_sDeskPdM072eOytLZQKGgVbyXNg0a6m5rsHurXu9KCc5kHwxwGgEeMCoxR-byq5_VbQRCSBeNDoPgNGGNGGMNUKnX7b-TnCIz_iiVRgqA7MM35Cw1gnBGu7sFr1Xex0V0wcHPqQhN-Bh1buHXm0Ibv3mXoY4KLmBp9hB8uBR_MpRI9rPK5NYcU29hnWIdk-tDlBzDy-pjd9MoT8L6Yb-vlbL15WdXVehaw5N2MUG4kEY5YJEWJNPOKMKu18koyTUqFPcNIOGq9wmgvhRXMcm60UVRauacT8HTZDc653SmFRqfz7noI_QW0t1NO</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Boubekeur, M. ; Schellekens, M.P.</creator><creatorcontrib>Boubekeur, M. ; Schellekens, M.P.</creatorcontrib><description>Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This paper presents dedicated techniques for optimization of formal verification of asynchronous circuits, these include for instance: automata reduction, pre-order reduction and automatic abstraction. All these techniques have been implemented and tested in a formal verification environment.</description><identifier>ISBN: 142441377X</identifier><identifier>ISBN: 9781424413775</identifier><identifier>EISBN: 1424413788</identifier><identifier>EISBN: 9781424413782</identifier><identifier>DOI: 10.1109/ICECS.2007.4510985</identifier><identifier>LCCN: 2007928620</identifier><language>eng</language><publisher>IEEE</publisher><subject>Asynchronous circuits ; Automata ; Circuit synthesis ; Circuit testing ; Cogeneration ; Computer displays ; Computer science ; Explosions ; Formal verification ; Interleaved codes</subject><ispartof>2007 14th IEEE International Conference on Electronics, Circuits and Systems, 2007, p.283-286</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/4510985$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4510985$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Boubekeur, M.</creatorcontrib><creatorcontrib>Schellekens, M.P.</creatorcontrib><title>Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits</title><title>2007 14th IEEE International Conference on Electronics, Circuits and Systems</title><addtitle>ICECS</addtitle><description>Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This paper presents dedicated techniques for optimization of formal verification of asynchronous circuits, these include for instance: automata reduction, pre-order reduction and automatic abstraction. All these techniques have been implemented and tested in a formal verification environment.</description><subject>Asynchronous circuits</subject><subject>Automata</subject><subject>Circuit synthesis</subject><subject>Circuit testing</subject><subject>Cogeneration</subject><subject>Computer displays</subject><subject>Computer science</subject><subject>Explosions</subject><subject>Formal verification</subject><subject>Interleaved codes</subject><isbn>142441377X</isbn><isbn>9781424413775</isbn><isbn>1424413788</isbn><isbn>9781424413782</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFUMtKAzEAjEhBW_sDeskPdM072eOytLZQKGgVbyXNg0a6m5rsHurXu9KCc5kHwxwGgEeMCoxR-byq5_VbQRCSBeNDoPgNGGNGGMNUKnX7b-TnCIz_iiVRgqA7MM35Cw1gnBGu7sFr1Xex0V0wcHPqQhN-Bh1buHXm0Ibv3mXoY4KLmBp9hB8uBR_MpRI9rPK5NYcU29hnWIdk-tDlBzDy-pjd9MoT8L6Yb-vlbL15WdXVehaw5N2MUG4kEY5YJEWJNPOKMKu18koyTUqFPcNIOGq9wmgvhRXMcm60UVRauacT8HTZDc653SmFRqfz7noI_QW0t1NO</recordid><startdate>200712</startdate><enddate>200712</enddate><creator>Boubekeur, M.</creator><creator>Schellekens, M.P.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200712</creationdate><title>Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits</title><author>Boubekeur, M. ; Schellekens, M.P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-235c726e2d07690a4f824daa8f874a2981f4106e3df810b76d64d55cac837d7b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Asynchronous circuits</topic><topic>Automata</topic><topic>Circuit synthesis</topic><topic>Circuit testing</topic><topic>Cogeneration</topic><topic>Computer displays</topic><topic>Computer science</topic><topic>Explosions</topic><topic>Formal verification</topic><topic>Interleaved codes</topic><toplevel>online_resources</toplevel><creatorcontrib>Boubekeur, M.</creatorcontrib><creatorcontrib>Schellekens, M.P.</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>Boubekeur, M.</au><au>Schellekens, M.P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits</atitle><btitle>2007 14th IEEE International Conference on Electronics, Circuits and Systems</btitle><stitle>ICECS</stitle><date>2007-12</date><risdate>2007</risdate><spage>283</spage><epage>286</epage><pages>283-286</pages><isbn>142441377X</isbn><isbn>9781424413775</isbn><eisbn>1424413788</eisbn><eisbn>9781424413782</eisbn><abstract>Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This paper presents dedicated techniques for optimization of formal verification of asynchronous circuits, these include for instance: automata reduction, pre-order reduction and automatic abstraction. All these techniques have been implemented and tested in a formal verification environment.</abstract><pub>IEEE</pub><doi>10.1109/ICECS.2007.4510985</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 142441377X
ispartof 2007 14th IEEE International Conference on Electronics, Circuits and Systems, 2007, p.283-286
issn
language eng
recordid cdi_ieee_primary_4510985
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Asynchronous circuits
Automata
Circuit synthesis
Circuit testing
Cogeneration
Computer displays
Computer science
Explosions
Formal verification
Interleaved codes
title Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T02%3A02%3A00IST&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=Automatic%20Optimization%20Techniques%20for%20Formal%20Verification%20of%20Asynchronous%20Circuits&rft.btitle=2007%2014th%20IEEE%20International%20Conference%20on%20Electronics,%20Circuits%20and%20Systems&rft.au=Boubekeur,%20M.&rft.date=2007-12&rft.spage=283&rft.epage=286&rft.pages=283-286&rft.isbn=142441377X&rft.isbn_list=9781424413775&rft_id=info:doi/10.1109/ICECS.2007.4510985&rft_dat=%3Cieee_6IE%3E4510985%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424413788&rft.eisbn_list=9781424413782&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4510985&rfr_iscdi=true