Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
Recently, we showed how to use control-flow refinement (CFR) to improve automatic complexity analysis of integer programs. While up to now CFR was limited to classical programs, in this paper we extend CFR to probabilistic programs and show its soundness for complexity analysis. To demonstrate its b...
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 | Lommen, Nils Meyer, Éléanore Giesl, Jürgen |
| description | Recently, we showed how to use control-flow refinement (CFR) to improve
automatic complexity analysis of integer programs. While up to now CFR was
limited to classical programs, in this paper we extend CFR to probabilistic
programs and show its soundness for complexity analysis. To demonstrate its
benefits, we implemented our new CFR technique in our complexity analysis tool
KoAT. |
| doi_str_mv | 10.48550/arxiv.2402.03891 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2402_03891</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2402_03891</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2402_038913</originalsourceid><addsrcrecordid>eNqFjr0KwjAURrM4iPoATt4XaE3_oI6lWAQXle4llUQuJLklCdq-vbS4Ox0-OPAdxvYJj_OyKPhRuBHfcZrzNOZZeUrW7F6TDY501Gj6wEMqtNJIG0CRg5rMoOWIYYLKCj159EAKbo560aNGH_A5r5cTxgNauFLVbtlKCe3l7scNOzTntr5Ey3k3ODTCTd0c0S0R2X_jC08ePPU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT</title><source>arXiv.org</source><creator>Lommen, Nils ; Meyer, Éléanore ; Giesl, Jürgen</creator><creatorcontrib>Lommen, Nils ; Meyer, Éléanore ; Giesl, Jürgen</creatorcontrib><description>Recently, we showed how to use control-flow refinement (CFR) to improve
automatic complexity analysis of integer programs. While up to now CFR was
limited to classical programs, in this paper we extend CFR to probabilistic
programs and show its soundness for complexity analysis. To demonstrate its
benefits, we implemented our new CFR technique in our complexity analysis tool
KoAT.</description><identifier>DOI: 10.48550/arxiv.2402.03891</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science</subject><creationdate>2024-02</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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2402.03891$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2402.03891$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Lommen, Nils</creatorcontrib><creatorcontrib>Meyer, Éléanore</creatorcontrib><creatorcontrib>Giesl, Jürgen</creatorcontrib><title>Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT</title><description>Recently, we showed how to use control-flow refinement (CFR) to improve
automatic complexity analysis of integer programs. While up to now CFR was
limited to classical programs, in this paper we extend CFR to probabilistic
programs and show its soundness for complexity analysis. To demonstrate its
benefits, we implemented our new CFR technique in our complexity analysis tool
KoAT.</description><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNqFjr0KwjAURrM4iPoATt4XaE3_oI6lWAQXle4llUQuJLklCdq-vbS4Ox0-OPAdxvYJj_OyKPhRuBHfcZrzNOZZeUrW7F6TDY501Gj6wEMqtNJIG0CRg5rMoOWIYYLKCj159EAKbo560aNGH_A5r5cTxgNauFLVbtlKCe3l7scNOzTntr5Ey3k3ODTCTd0c0S0R2X_jC08ePPU</recordid><startdate>20240206</startdate><enddate>20240206</enddate><creator>Lommen, Nils</creator><creator>Meyer, Éléanore</creator><creator>Giesl, Jürgen</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240206</creationdate><title>Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT</title><author>Lommen, Nils ; Meyer, Éléanore ; Giesl, Jürgen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2402_038913</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Lommen, Nils</creatorcontrib><creatorcontrib>Meyer, Éléanore</creatorcontrib><creatorcontrib>Giesl, Jürgen</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lommen, Nils</au><au>Meyer, Éléanore</au><au>Giesl, Jürgen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT</atitle><date>2024-02-06</date><risdate>2024</risdate><abstract>Recently, we showed how to use control-flow refinement (CFR) to improve
automatic complexity analysis of integer programs. While up to now CFR was
limited to classical programs, in this paper we extend CFR to probabilistic
programs and show its soundness for complexity analysis. To demonstrate its
benefits, we implemented our new CFR technique in our complexity analysis tool
KoAT.</abstract><doi>10.48550/arxiv.2402.03891</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2402.03891 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2402_03891 |
| source | arXiv.org |
| subjects | Computer Science - Logic in Computer Science |
| title | Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T08%3A14%3A15IST&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=Control-Flow%20Refinement%20for%20Complexity%20Analysis%20of%20Probabilistic%20Programs%20in%20KoAT&rft.au=Lommen,%20Nils&rft.date=2024-02-06&rft_id=info:doi/10.48550/arxiv.2402.03891&rft_dat=%3Carxiv_GOX%3E2402_03891%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 |