{"id":"https://openalex.org/W7119500610","doi":"https://doi.org/10.1145/3776691","title":"Verifying Almost-Sure Termination for Randomized Distributed Algorithms","display_name":"Verifying Almost-Sure Termination for Randomized Distributed Algorithms","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119500610","doi":"https://doi.org/10.1145/3776691"},"language":"en","primary_location":{"id":"doi:10.1145/3776691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776691","pdf_url":null,"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://doi.org/10.1145/3776691","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122374176","display_name":"Constantin Enea","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Constantin Enea","raw_affiliation_strings":["LIX - Ecole Polytechnique - Institut Polytechnique de Paris, Paris, France"],"raw_orcid":"https://orcid.org/0000-0003-2727-8865","affiliations":[{"raw_affiliation_string":"LIX - Ecole Polytechnique - Institut Polytechnique de Paris, Paris, France","institution_ids":["https://openalex.org/I142476485"]}]},{"author_position":"middle","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":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2136-0542","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087319342","display_name":"Harshit J. Motwani","orcid":"https://orcid.org/0000-0002-2142-4254"},"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":"Harshit Jitendra Motwani","raw_affiliation_strings":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2142-4254","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122373386","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":["MPI-SWS, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0009-0006-5187-5415","affiliations":[{"raw_affiliation_string":"MPI-SWS, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.9923,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.94687194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"10","issue":"POPL","first_page":"1412","last_page":"1441"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.0013000000035390258,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0008999999845400453,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.7928000092506409},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7915999889373779},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5335999727249146},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5289000272750854},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5194000005722046},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.47859999537467957},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.47589999437332153},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.42800000309944153},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.3783000111579895}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.7928000092506409},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7915999889373779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7184000015258789},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5335999727249146},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5289000272750854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5194000005722046},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.47859999537467957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47609999775886536},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.47589999437332153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4426000118255615},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.42800000309944153},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.3783000111579895},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.36910000443458557},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.36820000410079956},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C80966040","wikidata":"https://www.wikidata.org/wiki/Q7885028","display_name":"Uniform consensus","level":4,"score":0.2939999997615814},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26440000534057617},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.2615000009536743}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3776691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776691","pdf_url":null,"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/3776691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776691","pdf_url":null,"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":[{"score":0.6954064965248108,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"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/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W72346910","https://openalex.org/W1734364899","https://openalex.org/W1798280647","https://openalex.org/W1800185629","https://openalex.org/W1967908173","https://openalex.org/W1991153938","https://openalex.org/W2000108089","https://openalex.org/W2006699751","https://openalex.org/W2014552079","https://openalex.org/W2021907707","https://openalex.org/W2035362408","https://openalex.org/W2058630223","https://openalex.org/W2071659383","https://openalex.org/W2081320273","https://openalex.org/W2091188761","https://openalex.org/W2111619838","https://openalex.org/W2119091865","https://openalex.org/W2131848219","https://openalex.org/W2138467892","https://openalex.org/W2145939802","https://openalex.org/W2150990538","https://openalex.org/W2530137060","https://openalex.org/W2767778696","https://openalex.org/W2801026249","https://openalex.org/W2893610333","https://openalex.org/W2964102784","https://openalex.org/W3015125368","https://openalex.org/W3120281858","https://openalex.org/W3128905785","https://openalex.org/W4211222265","https://openalex.org/W4230058301","https://openalex.org/W4234924236","https://openalex.org/W4251986490","https://openalex.org/W4281612951","https://openalex.org/W4286500915","https://openalex.org/W4315606535","https://openalex.org/W4386794382","https://openalex.org/W4388297583","https://openalex.org/W4390605099","https://openalex.org/W4392577507","https://openalex.org/W4402040441","https://openalex.org/W4406197122","https://openalex.org/W4410204578"],"related_works":[],"abstract_inverted_index":{"We":[0,101,117],"present":[1],"a":[2,36,111],"technique":[3,15],"for":[4,19,25,29,40,51,85,114,126,141],"the":[5,69,158],"verification":[6],"of":[7,10,44,83,109,129,153,160],"liveness":[8],"properties":[9,128],"randomized":[11,130],"distributed":[12,45],"algorithms.":[13],"Our":[14,59],"gives":[16],"SMT-based":[17,124],"proofs":[18,125,152],"many":[20],"common":[21],"consensus":[22,132],"algorithms,":[23],"both":[24,142],"crash":[26,143],"faults":[27],"and":[28,73,137,144],"Byzantine":[30,145],"faults.":[31,146],"It":[32],"is":[33,62,77],"based":[34],"on":[35,91,96,107],"sound":[37],"proof":[38,60,105,120,162],"rule":[39,61,121],"fair":[41],"almost-sure":[42,52],"termination":[43,53,127,154],"systems":[46],"that":[47],"combines":[48],"martingale-based":[49],"techniques":[50],"with":[54],"reasoning":[55],"about":[56],"weak":[57],"fairness.":[58,100],"able":[63],"to":[64,98,122],"handle":[65],"parametrized":[66],"protocols":[67,80,148],"where":[68],"state":[70],"grows":[71],"unboundedly":[72],"every":[74],"variant":[75,93],"function":[76],"unbounded.":[78],"These":[79,147],"were":[81],"out":[82],"scope":[84,159],"previous":[86],"approaches,":[87],"which":[88],"either":[89],"relied":[90],"bounded":[92],"functions":[94],"or":[95],"reductions":[97],"(non-probabilistic)":[99],"have":[102,149],"implemented":[103],"our":[104,119,161],"rules":[106],"top":[108],"Caesar,":[110],"program":[112],"verifier":[113],"probabilistic":[115],"programs.":[116],"use":[118],"give":[123],"asynchronous":[131],"protocols,":[133],"including":[134],"Ben-Or\u2019s":[135],"protocol":[136],"graded":[138],"binary":[139],"consensus,":[140],"notoriously":[150],"difficult":[151],"but":[155],"fall":[156],"within":[157],"rule.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2026-01-09T00:00:00"}