{"id":"https://openalex.org/W4390605099","doi":"https://doi.org/10.1145/3632879","title":"Positive Almost-Sure Termination: Complexity and Proof Rules","display_name":"Positive Almost-Sure Termination: Complexity and Proof Rules","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390605099","doi":"https://doi.org/10.1145/3632879"},"language":"en","primary_location":{"id":"doi:10.1145/3632879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632879","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632879","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632879","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081010207","display_name":"Rupak Majumdar","orcid":"https://orcid.org/0000-0003-2136-0542"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rupak Majumdar","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2136-0542","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093129913","display_name":"V. R. Sathiyanarayana","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"V. R. Sathiyanarayana","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0009-0006-5187-5415","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":2.9681,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.91474037,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"POPL","first_page":"1089","last_page":"1117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8345916867256165},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6756893396377563},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5911992192268372},{"id":"https://openalex.org/keywords/transfinite-number","display_name":"Transfinite number","score":0.5224948525428772},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5023508071899414},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4590972065925598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44226574897766113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43700703978538513},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42203861474990845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24388012290000916}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8345916867256165},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6756893396377563},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5911992192268372},{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.5224948525428772},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5023508071899414},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4590972065925598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44226574897766113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43700703978538513},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42203861474990845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24388012290000916},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3632879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632879","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632879","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3632879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632879","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632879","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4099999964237213,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3032849772","display_name":null,"funder_award_id":"TRR 248","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G890954746","display_name":"TRR 248: Grundlagen verst\u00e4ndlicher SoftwareSysteme  f\u00fcr eine nachvollziehbare cyberphysische Welt","funder_award_id":"389792660","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320314997","display_name":"Strong","ror":"https://ror.org/041vyzr56"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390605099.pdf","grobid_xml":"https://content.openalex.org/works/W4390605099.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W72346910","https://openalex.org/W109993195","https://openalex.org/W1563374593","https://openalex.org/W1589106570","https://openalex.org/W1605543919","https://openalex.org/W1734364899","https://openalex.org/W1974824584","https://openalex.org/W1997804367","https://openalex.org/W2014552079","https://openalex.org/W2018908462","https://openalex.org/W2081739832","https://openalex.org/W2085533703","https://openalex.org/W2126160338","https://openalex.org/W2134330476","https://openalex.org/W2166496828","https://openalex.org/W2294463722","https://openalex.org/W2296309018","https://openalex.org/W2296540112","https://openalex.org/W2435583538","https://openalex.org/W2548604229","https://openalex.org/W2598547732","https://openalex.org/W2767778696","https://openalex.org/W2803490327","https://openalex.org/W2807469900","https://openalex.org/W2808151598","https://openalex.org/W2893610333","https://openalex.org/W2908549554","https://openalex.org/W2964102784","https://openalex.org/W2982085742","https://openalex.org/W3119972339","https://openalex.org/W3144365821","https://openalex.org/W3155501771","https://openalex.org/W3166773424","https://openalex.org/W3171209508","https://openalex.org/W3189389740","https://openalex.org/W4240126131","https://openalex.org/W4242281791","https://openalex.org/W4281612951"],"related_works":["https://openalex.org/W3125250027","https://openalex.org/W2278329956","https://openalex.org/W1998092208","https://openalex.org/W1996880246","https://openalex.org/W3008777928","https://openalex.org/W3149394920","https://openalex.org/W2950416039","https://openalex.org/W1517042805","https://openalex.org/W1597181838","https://openalex.org/W2161824925"],"abstract_inverted_index":{"We":[0,46,169,218],"study":[1],"the":[2,34,39,56,70,134,155,164],"recursion-theoretic":[3],"complexity":[4],"of":[5,73,82],"Positive":[6],"Almost-Sure":[7,74],"Termination":[8,75,79],"(PAST)":[9],"in":[10,67,114,125,180],"an":[11,101,145,175],"imperative":[12],"programming":[13],"language":[14,52],"with":[15,117,127,139,150,192],"rational":[16],"variables,":[17],"bounded":[18,118,151],"nondeterministic":[19,141],"choice,":[20,142],"and":[21,38,77,91,120,161,206],"discrete":[22],"probabilistic":[23,108,148,183,237],"choice.":[24],"A":[25],"program":[26,35,123,138,149,157,166,173,245],"terminates":[27,36,188],"positive":[28],"almost-surely":[29,37],"if,":[30,160,163],"for":[31,50,55,136,210,236],"every":[32,137,172],"scheduler,":[33],"expected":[40],"runtime":[41],"to":[42,69,104,110,121,228,247,252],"termination":[43,109,113,124,238],"is":[44,53,66,144,158,167],"finite.":[45],"show":[47,170,219],"that":[48,154,171,220,243],"PAST":[49,223],"our":[51],"complete":[54,207],"(lightface)":[57],"co-analytic":[58],"sets":[59],"(":[60,86],"\u03a0":[61,87],"1":[62,63,194,230],"-complete).":[64],"This":[65],"contrast":[68],"related":[71],"notions":[72],"(AST)":[76],"Bounded":[78],"(BAST),":[80],"both":[81],"which":[83,181],"are":[84],"arithmetical":[85],"2":[88,93,196],"0":[89,94],"-":[90],"\u03a3":[92],"-complete":[95],"respectively).":[96],"Our":[97,130,212],"upper":[98],"bound":[99,132],"implies":[100],"effective":[102],"procedure":[103],"reduce":[105],"reasoning":[106,221],"about":[107,222,254],"non-probabilistic":[111],"fair":[112],"a":[115,204],"model":[116],"nondeterminism,":[119],"simple":[122],"models":[126],"unbounded":[128,140],"nondeterminism.":[129],"lower":[131],"shows":[133],"opposite:":[135],"there":[143],"effectively":[146,176],"computable":[147,177],"choice":[152,184],"such":[153],"original":[156],"terminating":[159],"only":[162],"transformed":[165],"PAST.":[168,211,255],"has":[174],"normal":[178,199],"form,":[179],"each":[182,191],"either":[185],"continues":[186],"or":[187],"execution":[189],"immediately,":[190],"probability":[193],"/":[195],".":[197],"For":[198],"form":[200],"programs,":[201],"we":[202],"provide":[203],"sound":[205],"proof":[208,213],"rule":[209,214],"uses":[215],"transfinite":[216,225],"ordinals.":[217],"requires":[224],"ordinals":[226],"up":[227],"\u03c9":[229],"CK":[231],";":[232],"thus,":[233],"existing":[234],"techniques":[235],"based":[239],"on":[240],"ranking":[241],"supermartingales":[242],"map":[244],"states":[246],"reals":[248],"do":[249],"not":[250],"suffice":[251],"reason":[253]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}