On the Termination Problem for Probabilistic Higher-Order Recursive Programs
In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study o...
Uložené v:
| Vydané v: | Logical methods in computer science Ročník 16, Issue 4 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Logical Methods in Computer Science Association
02.10.2020
Logical Methods in Computer Science e.V |
| Predmet: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study on the probabilistic higher-order model checking problem, by giving some first theoretical and experimental results. As a first step towards our goal, we introduce PHORS, a probabilistic extension of higher-order recursion schemes (HORS), as a model of probabilistic higher-order programs. The model of PHORS may alternatively be viewed as a higher-order extension of recursive Markov chains. We then investigate the probabilistic termination problem -- or, equivalently, the probabilistic reachability problem. We prove that almost sure termination of order-2 PHORS is undecidable. We also provide a fixpoint characterization of the termination probability of PHORS, and develop a sound (but possibly incomplete) procedure for approximately computing the termination probability. We have implemented the procedure for order-2 PHORSs, and confirmed that the procedure works well through preliminary experiments that are reported at the end of the article. |
|---|---|
| AbstractList | In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study on the probabilistic higher-order model checking problem, by giving some first theoretical and experimental results. As a first step towards our goal, we introduce PHORS, a probabilistic extension of higher-order recursion schemes (HORS), as a model of probabilistic higher-order programs. The model of PHORS may alternatively be viewed as a higher-order extension of recursive Markov chains. We then investigate the probabilistic termination problem-or, equivalently, the probabilistic reachability problem. We prove that almost sure termination of order-2 PHORS is undecidable. We also provide a fixpoint characterization of the termination probability of PHORS, and develop a sound (although possibly incomplete) procedure for approximately computing the termination probability. We have implemented the procedure for order-2 PHORS, and confirmed that the procedure works well through preliminary experiments. In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of higher-order probabilistic programming languages, not much has been done to combine those two approaches. In this paper, we initiate a study on the probabilistic higher-order model checking problem, by giving some first theoretical and experimental results. As a first step towards our goal, we introduce PHORS, a probabilistic extension of higher-order recursion schemes (HORS), as a model of probabilistic higher-order programs. The model of PHORS may alternatively be viewed as a higher-order extension of recursive Markov chains. We then investigate the probabilistic termination problem -- or, equivalently, the probabilistic reachability problem. We prove that almost sure termination of order-2 PHORS is undecidable. We also provide a fixpoint characterization of the termination probability of PHORS, and develop a sound (but possibly incomplete) procedure for approximately computing the termination probability. We have implemented the procedure for order-2 PHORSs, and confirmed that the procedure works well through preliminary experiments that are reported at the end of the article. |
| Author | Lago, Ugo Dal Kobayashi, Naoki Grellois, Charles |
| Author_xml | – sequence: 1 givenname: Naoki surname: Kobayashi fullname: Kobayashi, Naoki – sequence: 2 givenname: Ugo Dal orcidid: 0000-0001-9200-070X surname: Lago fullname: Lago, Ugo Dal – sequence: 3 givenname: Charles surname: Grellois fullname: Grellois, Charles |
| BackLink | https://inria.hal.science/hal-03120859$$DView record in HAL |
| BookMark | eNpVkVtLw0AQhRdRsNb-AN_yaB-ie8tefCtFbSFS0b4ve0u7JcnKphb89yatiM7LDIdvzgycK3DextYDcIPgHSaMiPvyZf6eI3ZLH_AUQwzPwAgJBvNCcnr-Z74Ek67bwb4IQQKzEShXbbbf-mztUxNavQ-xzV5TNLVvsiqm46xNqEO3DzZbhM3Wp3yVnE_Zm7efqQsHP0CbpJvuGlxUuu785KePwfrpcT1f5OXqeTmflbklFO5zaoTjkDFiDGHWCUwriSvtCmmhY8wi5jkxlXe-xzGi3GCOmPASIaNxRcZgebJ1Ue_URwqNTl8q6qCOQkwbpVP_bu2VllJTyZ2sbEE54lpYQaXvbxaFgQ71XtOT11bX_6wWs1INGiQIQ1HIA-5ZdGJtil2XfPW7gKA6BqGGIBRiiiqshiDIN57lfDc |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.23638/LMCS-16(4:2)2020 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_a99a497d9fc54717a8c849ed8255b0d1 oai:HAL:hal-03120859v2 10_23638_LMCS_16_4_2_2020 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB 1XC VOOES |
| ID | FETCH-LOGICAL-c340t-4b8d70663bb36cd824f92fad59c0d66c16e73bfede3402147b27168e911ba2f3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000605983500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:52:58 EDT 2025 Tue Oct 14 20:29:24 EDT 2025 Sat Nov 29 08:03:01 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | model checking probabilistic programs higher-order programs termination probabilities |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c340t-4b8d70663bb36cd824f92fad59c0d66c16e73bfede3402147b27168e911ba2f3 |
| ORCID | 0000-0001-9200-070X |
| OpenAccessLink | https://doaj.org/article/a99a497d9fc54717a8c849ed8255b0d1 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a99a497d9fc54717a8c849ed8255b0d1 hal_primary_oai_HAL_hal_03120859v2 crossref_primary_10_23638_LMCS_16_4_2_2020 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-10-02 |
| PublicationDateYYYYMMDD | 2020-10-02 |
| PublicationDate_xml | – month: 10 year: 2020 text: 2020-10-02 day: 02 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2020 |
| Publisher | Logical Methods in Computer Science Association Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science Association – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.326335 |
| Snippet | In the last two decades, there has been much progress on model checking of both probabilistic systems and higher-order programs. In spite of the emergence of... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| SubjectTerms | Computer Science computer science - logic in computer science computer science - programming languages Logic in Computer Science |
| Title | On the Termination Problem for Probabilistic Higher-Order Recursive Programs |
| URI | https://inria.hal.science/hal-03120859 https://doaj.org/article/a99a497d9fc54717a8c849ed8255b0d1 |
| Volume | 16, Issue 4 |
| WOSCitedRecordID | wos000605983500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcDCG1FeshADIEVNbCex2Qqi6lAogg5sVvwSLAG1pSO_nTsnRTCxsESRYznWZ_t8Z5--j5AzcGkrkzuTVCErEiGVgDXnZSKE8lJ4hdx3UWyivL-Xz8_q4YfUF-aENfTADXC9SqlKqNKpYHMwpGUlrYR2HEQ2uUldDHzSUv0IpqIN5hwd5-Yak3GYZL3R3c1TkhXn4opdQMSf_tqIIl8_bC8vy-PUuL0MNsl66xfSftOfLbLi622ysdRcoO0S3CGjcU3BZ6OTJokFYaUPjSgMBf8zvkfSXORfpk0WRzJGfk36iEfrmK2OlTApa7ZLJoPbyc0waRUREstFOk-Eka5EJ8EYXljAQATFQuVyZVNXFDYrfMlN8M5DdVQgMgziIenBopmKBb5HOvVb7fcJVXnluc2ZtUEI4wJ8DblXpRUpl8ZkXXK5REe_N7wXGuKFCKVGKHVWaKGZRii75Brx-66IlNWxAAZStwOp_xrILjkF9H-1MeyPNJaB4UEpUbVgB__xp0Oyhr2OKXnsiHTm0w9_TFbtYv46m57EiQTPu8_bL0XXzKY |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Termination+Problem+for+Probabilistic+Higher-Order+Recursive+Programs&rft.jtitle=Logical+methods+in+computer+science&rft.au=Kobayashi%2C+Naoki&rft.au=Dal+Lago%2C+Ugo&rft.au=Grellois%2C+Charles&rft.date=2020-10-02&rft.pub=Logical+Methods+in+Computer+Science+Association&rft.eissn=1860-5974&rft_id=info:doi/10.23638%2FLMCS-16%284%3A2%292020&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-03120859v2 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |