Parameterized Verification under TSO with Data Types
We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability prob...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2023-02 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Parosh Aziz Abdulla Atig, Mohamed Faouzi Furbach, Florian Godbole, Adwait Hendi, Yacoub G Shankaranarayanan Krishna Spengler, Stephan |
| description | We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability problem for register machines enriched with the given abstract data type. We use the translation to obtain tight complexity bounds for TSO-based parameterized verification over several abstract data types, such as push-down automata, ordered multi push-down automata, one-counter nets, one-counter automata, and Petri nets. We apply the framework to get complexity bounds for higher order stack and counter variants as well. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2774362270</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2774362270</sourcerecordid><originalsourceid>FETCH-proquest_journals_27743622703</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwCUgsSsxNLUktyqxKTVEIA9JpmcmJJZn5eQqleSmpRQohwf4K5ZklGQouiSWJCiGVBanFPAysaYk5xam8UJqbQdnNNcTZQ7egKL-wNLW4JD4rv7QoDygVb2RubmJsZmRkbmBMnCoAR040WA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2774362270</pqid></control><display><type>article</type><title>Parameterized Verification under TSO with Data Types</title><source>Freely Accessible Journals</source><creator>Parosh Aziz Abdulla ; Atig, Mohamed Faouzi ; Furbach, Florian ; Godbole, Adwait ; Hendi, Yacoub G ; Shankaranarayanan Krishna ; Spengler, Stephan</creator><creatorcontrib>Parosh Aziz Abdulla ; Atig, Mohamed Faouzi ; Furbach, Florian ; Godbole, Adwait ; Hendi, Yacoub G ; Shankaranarayanan Krishna ; Spengler, Stephan</creatorcontrib><description>We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability problem for register machines enriched with the given abstract data type. We use the translation to obtain tight complexity bounds for TSO-based parameterized verification over several abstract data types, such as push-down automata, ordered multi push-down automata, one-counter nets, one-counter automata, and Petri nets. We apply the framework to get complexity bounds for higher order stack and counter variants as well.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Complexity ; Parameterization ; Petri nets ; Semantics ; Verification</subject><ispartof>arXiv.org, 2023-02</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Parosh Aziz Abdulla</creatorcontrib><creatorcontrib>Atig, Mohamed Faouzi</creatorcontrib><creatorcontrib>Furbach, Florian</creatorcontrib><creatorcontrib>Godbole, Adwait</creatorcontrib><creatorcontrib>Hendi, Yacoub G</creatorcontrib><creatorcontrib>Shankaranarayanan Krishna</creatorcontrib><creatorcontrib>Spengler, Stephan</creatorcontrib><title>Parameterized Verification under TSO with Data Types</title><title>arXiv.org</title><description>We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability problem for register machines enriched with the given abstract data type. We use the translation to obtain tight complexity bounds for TSO-based parameterized verification over several abstract data types, such as push-down automata, ordered multi push-down automata, one-counter nets, one-counter automata, and Petri nets. We apply the framework to get complexity bounds for higher order stack and counter variants as well.</description><subject>Complexity</subject><subject>Parameterization</subject><subject>Petri nets</subject><subject>Semantics</subject><subject>Verification</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQwCUgsSsxNLUktyqxKTVEIA9JpmcmJJZn5eQqleSmpRQohwf4K5ZklGQouiSWJCiGVBanFPAysaYk5xam8UJqbQdnNNcTZQ7egKL-wNLW4JD4rv7QoDygVb2RubmJsZmRkbmBMnCoAR040WA</recordid><startdate>20230212</startdate><enddate>20230212</enddate><creator>Parosh Aziz Abdulla</creator><creator>Atig, Mohamed Faouzi</creator><creator>Furbach, Florian</creator><creator>Godbole, Adwait</creator><creator>Hendi, Yacoub G</creator><creator>Shankaranarayanan Krishna</creator><creator>Spengler, Stephan</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230212</creationdate><title>Parameterized Verification under TSO with Data Types</title><author>Parosh Aziz Abdulla ; Atig, Mohamed Faouzi ; Furbach, Florian ; Godbole, Adwait ; Hendi, Yacoub G ; Shankaranarayanan Krishna ; Spengler, Stephan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27743622703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Complexity</topic><topic>Parameterization</topic><topic>Petri nets</topic><topic>Semantics</topic><topic>Verification</topic><toplevel>online_resources</toplevel><creatorcontrib>Parosh Aziz Abdulla</creatorcontrib><creatorcontrib>Atig, Mohamed Faouzi</creatorcontrib><creatorcontrib>Furbach, Florian</creatorcontrib><creatorcontrib>Godbole, Adwait</creatorcontrib><creatorcontrib>Hendi, Yacoub G</creatorcontrib><creatorcontrib>Shankaranarayanan Krishna</creatorcontrib><creatorcontrib>Spengler, Stephan</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Parosh Aziz Abdulla</au><au>Atig, Mohamed Faouzi</au><au>Furbach, Florian</au><au>Godbole, Adwait</au><au>Hendi, Yacoub G</au><au>Shankaranarayanan Krishna</au><au>Spengler, Stephan</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Parameterized Verification under TSO with Data Types</atitle><jtitle>arXiv.org</jtitle><date>2023-02-12</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>We consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability problem for register machines enriched with the given abstract data type. We use the translation to obtain tight complexity bounds for TSO-based parameterized verification over several abstract data types, such as push-down automata, ordered multi push-down automata, one-counter nets, one-counter automata, and Petri nets. We apply the framework to get complexity bounds for higher order stack and counter variants as well.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2023-02 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2774362270 |
| source | Freely Accessible Journals |
| subjects | Complexity Parameterization Petri nets Semantics Verification |
| title | Parameterized Verification under TSO with Data Types |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T11%3A52%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Parameterized%20Verification%20under%20TSO%20with%20Data%20Types&rft.jtitle=arXiv.org&rft.au=Parosh%20Aziz%20Abdulla&rft.date=2023-02-12&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2774362270%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2774362270&rft_id=info:pmid/&rfr_iscdi=true |