On Higher-Order Reachability Games vs May Reachability
We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with angelic and demonic nondeterminism) and may-reachability (i.e., the reachability problem for programs with only angelic no...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Asada, Kazuyuki Katsura, Hiroyuki Kobayashi, Naoki |
| description | We consider the reachability problem for higher-order functional programs and
study the relationship between reachability games (i.e., the reachability
problem for programs with angelic and demonic nondeterminism) and
may-reachability (i.e., the reachability problem for programs with only angelic
nondeterminism). We show that reachability games for order-n programs can be
reduced to may-reachability for order-(n+1) programs, and vice versa. We
formalize the reductions by using higher-order fixpoint logic and prove their
correctness. We also discuss applications of the reductions to higher-order
program verification. |
| doi_str_mv | 10.48550/arxiv.2203.08416 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2203_08416</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2203_08416</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-dc690d0bcf87fc58f9a94bea3bc5023541caec69a07852ee2bdeefe13255ed4d3</originalsourceid><addsrcrecordid>eNpVj82KwjAUhbNxIdUHcGVeoDXNX9OliKOCUhD35Sa50YCKpCL27cdx3Lg6i3P4OB8hk5IV0ijFZpCe8VFwzkTBjCz1kOjmStfxeMKUN8ljonsEdwIbz_He0xVcsKOPju6g_2pGZBDg3OH4kxk5_CwPi3W-bVabxXybg6507p2umWfWBVMFp0yooZYWQVinGBdKlg7wtQFWGcURufWIAUvBlUIvvcjI9B_7Pt7eUrxA6ts_gfYtIH4B0_9Aog</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On Higher-Order Reachability Games vs May Reachability</title><source>arXiv.org</source><creator>Asada, Kazuyuki ; Katsura, Hiroyuki ; Kobayashi, Naoki</creator><creatorcontrib>Asada, Kazuyuki ; Katsura, Hiroyuki ; Kobayashi, Naoki</creatorcontrib><description>We consider the reachability problem for higher-order functional programs and
study the relationship between reachability games (i.e., the reachability
problem for programs with angelic and demonic nondeterminism) and
may-reachability (i.e., the reachability problem for programs with only angelic
nondeterminism). We show that reachability games for order-n programs can be
reduced to may-reachability for order-(n+1) programs, and vice versa. We
formalize the reductions by using higher-order fixpoint logic and prove their
correctness. We also discuss applications of the reductions to higher-order
program verification.</description><identifier>DOI: 10.48550/arxiv.2203.08416</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science ; Computer Science - Programming Languages</subject><creationdate>2022-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</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>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2203.08416$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2203.08416$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Asada, Kazuyuki</creatorcontrib><creatorcontrib>Katsura, Hiroyuki</creatorcontrib><creatorcontrib>Kobayashi, Naoki</creatorcontrib><title>On Higher-Order Reachability Games vs May Reachability</title><description>We consider the reachability problem for higher-order functional programs and
study the relationship between reachability games (i.e., the reachability
problem for programs with angelic and demonic nondeterminism) and
may-reachability (i.e., the reachability problem for programs with only angelic
nondeterminism). We show that reachability games for order-n programs can be
reduced to may-reachability for order-(n+1) programs, and vice versa. We
formalize the reductions by using higher-order fixpoint logic and prove their
correctness. We also discuss applications of the reductions to higher-order
program verification.</description><subject>Computer Science - Logic in Computer Science</subject><subject>Computer Science - Programming Languages</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpVj82KwjAUhbNxIdUHcGVeoDXNX9OliKOCUhD35Sa50YCKpCL27cdx3Lg6i3P4OB8hk5IV0ijFZpCe8VFwzkTBjCz1kOjmStfxeMKUN8ljonsEdwIbz_He0xVcsKOPju6g_2pGZBDg3OH4kxk5_CwPi3W-bVabxXybg6507p2umWfWBVMFp0yooZYWQVinGBdKlg7wtQFWGcURufWIAUvBlUIvvcjI9B_7Pt7eUrxA6ts_gfYtIH4B0_9Aog</recordid><startdate>20220316</startdate><enddate>20220316</enddate><creator>Asada, Kazuyuki</creator><creator>Katsura, Hiroyuki</creator><creator>Kobayashi, Naoki</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220316</creationdate><title>On Higher-Order Reachability Games vs May Reachability</title><author>Asada, Kazuyuki ; Katsura, Hiroyuki ; Kobayashi, Naoki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-dc690d0bcf87fc58f9a94bea3bc5023541caec69a07852ee2bdeefe13255ed4d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Computer Science - Programming Languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Asada, Kazuyuki</creatorcontrib><creatorcontrib>Katsura, Hiroyuki</creatorcontrib><creatorcontrib>Kobayashi, Naoki</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Asada, Kazuyuki</au><au>Katsura, Hiroyuki</au><au>Kobayashi, Naoki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Higher-Order Reachability Games vs May Reachability</atitle><date>2022-03-16</date><risdate>2022</risdate><abstract>We consider the reachability problem for higher-order functional programs and
study the relationship between reachability games (i.e., the reachability
problem for programs with angelic and demonic nondeterminism) and
may-reachability (i.e., the reachability problem for programs with only angelic
nondeterminism). We show that reachability games for order-n programs can be
reduced to may-reachability for order-(n+1) programs, and vice versa. We
formalize the reductions by using higher-order fixpoint logic and prove their
correctness. We also discuss applications of the reductions to higher-order
program verification.</abstract><doi>10.48550/arxiv.2203.08416</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2203.08416 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2203_08416 |
| source | arXiv.org |
| subjects | Computer Science - Logic in Computer Science Computer Science - Programming Languages |
| title | On Higher-Order Reachability Games vs May Reachability |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T07%3A51%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Higher-Order%20Reachability%20Games%20vs%20May%20Reachability&rft.au=Asada,%20Kazuyuki&rft.date=2022-03-16&rft_id=info:doi/10.48550/arxiv.2203.08416&rft_dat=%3Carxiv_GOX%3E2203_08416%3C/arxiv_GOX%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 |