Automatic formal verification of clock domain crossing signals

Automatic formal verification of clock domain crossing signals

In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Li, Bing, Kwok, Chris Ka-Kei
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Software and its engineering
Software and its engineering > Software creation and management
Software and its engineering > Software creation and management > Software verification and validation
Software and its engineering > Software creation and management > Software verification and validation > Formal software verification
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 659
container_issue
container_start_page 654
container_title
container_volume
creator Li, Bing
Kwok, Chris Ka-Kei
description In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic. After that a fully automatic, on-the-fly formal CDC approach is proposed. To the best of our knowledge, this is the first paper discussing fully automatic, on-the-fly formal verification of CDC signals. Experiment results show that our automatic formal CDC, when compared with the conventional post-CDC formal CDC, takes much less time, but still prove significant number of CDC checks.
doi_str_mv 10.5555/1509633.1509782
format Conference Proceeding
fullrecord <record><control><sourceid>acm</sourceid><recordid>TN_cdi_acm_books_10_5555_1509633_1509782_brief</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>acm_books_10_5555_1509633_1509782</sourcerecordid><originalsourceid>FETCH-LOGICAL-a157t-da68cc09d10800a61ed8ad2591acce55848ece00beff556067515392fe19d2e63</originalsourceid><addsrcrecordid>eNqNjztrwzAUhQWl0JJ6zqqxi129riwvhRD6CAS6NLOQ9QhqbAsst7-_CvUP6Fk-uJxz4UNoS0kDJU8USCc5b65sFbtBVQEVTAjWCsXuUJXzFykRwEHQe_S8-17SaJZocUjzaAb84-cYoi2nNOEUsB2SvWBXSnHCdk45x-mMczxPZsgP6DYU-GrlBp1eXz737_Xx4-2w3x1rQ6FdamekspZ0jhJFiJHUO2Ucg44aaz2AEspbT0jvQwCQRLZAgXcseNo55iXfoObvr7Gj7lO6ZE2JvirrVVmvyrqfow9l8PjPAf8FzTxXiQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Automatic formal verification of clock domain crossing signals</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Li, Bing ; Kwok, Chris Ka-Kei</creator><creatorcontrib>Li, Bing ; Kwok, Chris Ka-Kei</creatorcontrib><description>In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic. After that a fully automatic, on-the-fly formal CDC approach is proposed. To the best of our knowledge, this is the first paper discussing fully automatic, on-the-fly formal verification of CDC signals. Experiment results show that our automatic formal CDC, when compared with the conventional post-CDC formal CDC, takes much less time, but still prove significant number of CDC checks.</description><identifier>ISBN: 9781424427482</identifier><identifier>ISBN: 1424427487</identifier><identifier>DOI: 10.5555/1509633.1509782</identifier><language>eng</language><publisher>Piscataway, NJ, USA: IEEE Press</publisher><subject>Software and its engineering ; Software and its engineering -- Software creation and management ; Software and its engineering -- Software creation and management -- Software verification and validation ; Software and its engineering -- Software creation and management -- Software verification and validation -- Formal software verification</subject><ispartof>Proceedings of the 2009 Asia and South Pacific Design Automation Conference, 2009, p.654-659</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,776,780,785,786,27902</link.rule.ids></links><search><creatorcontrib>Li, Bing</creatorcontrib><creatorcontrib>Kwok, Chris Ka-Kei</creatorcontrib><title>Automatic formal verification of clock domain crossing signals</title><title>Proceedings of the 2009 Asia and South Pacific Design Automation Conference</title><description>In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic. After that a fully automatic, on-the-fly formal CDC approach is proposed. To the best of our knowledge, this is the first paper discussing fully automatic, on-the-fly formal verification of CDC signals. Experiment results show that our automatic formal CDC, when compared with the conventional post-CDC formal CDC, takes much less time, but still prove significant number of CDC checks.</description><subject>Software and its engineering</subject><subject>Software and its engineering -- Software creation and management</subject><subject>Software and its engineering -- Software creation and management -- Software verification and validation</subject><subject>Software and its engineering -- Software creation and management -- Software verification and validation -- Formal software verification</subject><isbn>9781424427482</isbn><isbn>1424427487</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid/><recordid>eNqNjztrwzAUhQWl0JJ6zqqxi129riwvhRD6CAS6NLOQ9QhqbAsst7-_CvUP6Fk-uJxz4UNoS0kDJU8USCc5b65sFbtBVQEVTAjWCsXuUJXzFykRwEHQe_S8-17SaJZocUjzaAb84-cYoi2nNOEUsB2SvWBXSnHCdk45x-mMczxPZsgP6DYU-GrlBp1eXz737_Xx4-2w3x1rQ6FdamekspZ0jhJFiJHUO2Ucg44aaz2AEspbT0jvQwCQRLZAgXcseNo55iXfoObvr7Gj7lO6ZE2JvirrVVmvyrqfow9l8PjPAf8FzTxXiQ</recordid><startdate>20090119</startdate><enddate>20090119</enddate><creator>Li, Bing</creator><creator>Kwok, Chris Ka-Kei</creator><general>IEEE Press</general><scope/></search><sort><creationdate>20090119</creationdate><title>Automatic formal verification of clock domain crossing signals</title><author>Li, Bing ; Kwok, Chris Ka-Kei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a157t-da68cc09d10800a61ed8ad2591acce55848ece00beff556067515392fe19d2e63</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Software and its engineering</topic><topic>Software and its engineering -- Software creation and management</topic><topic>Software and its engineering -- Software creation and management -- Software verification and validation</topic><topic>Software and its engineering -- Software creation and management -- Software verification and validation -- Formal software verification</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Bing</creatorcontrib><creatorcontrib>Kwok, Chris Ka-Kei</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Bing</au><au>Kwok, Chris Ka-Kei</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Automatic formal verification of clock domain crossing signals</atitle><btitle>Proceedings of the 2009 Asia and South Pacific Design Automation Conference</btitle><date>2009-01-19</date><risdate>2009</risdate><spage>654</spage><epage>659</epage><pages>654-659</pages><isbn>9781424427482</isbn><isbn>1424427487</isbn><abstract>In this paper, we present an approach that uses formal methods to verify Clock Domain Crossing (CDC) issues in a fully automatic way. First, we discuss various CDC schemes and the corresponding checks that need to be formally verified. Then we demonstrate how to synthesize them into assertion logic. After that a fully automatic, on-the-fly formal CDC approach is proposed. To the best of our knowledge, this is the first paper discussing fully automatic, on-the-fly formal verification of CDC signals. Experiment results show that our automatic formal CDC, when compared with the conventional post-CDC formal CDC, takes much less time, but still prove significant number of CDC checks.</abstract><cop>Piscataway, NJ, USA</cop><pub>IEEE Press</pub><doi>10.5555/1509633.1509782</doi><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISBN: 9781424427482
ispartof Proceedings of the 2009 Asia and South Pacific Design Automation Conference, 2009, p.654-659
issn
language eng
recordid cdi_acm_books_10_5555_1509633_1509782_brief
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Software and its engineering
Software and its engineering -- Software creation and management
Software and its engineering -- Software creation and management -- Software verification and validation
Software and its engineering -- Software creation and management -- Software verification and validation -- Formal software verification
title Automatic formal verification of clock domain crossing signals
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T00%3A21%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Automatic%20formal%20verification%20of%20clock%20domain%20crossing%20signals&rft.btitle=Proceedings%20of%20the%202009%20Asia%20and%20South%20Pacific%20Design%20Automation%20Conference&rft.au=Li,%20Bing&rft.date=2009-01-19&rft.spage=654&rft.epage=659&rft.pages=654-659&rft.isbn=9781424427482&rft.isbn_list=1424427487&rft_id=info:doi/10.5555/1509633.1509782&rft_dat=%3Cacm%3Eacm_books_10_5555_1509633_1509782%3C/acm%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true