{"id":"https://openalex.org/W7224947349","doi":"https://doi.org/10.48550/arxiv.2610.39723","title":"Countable Nondeterminism in Weighted Programming with an Application to Mechanized Foundations for Probabilistic Program Verification","display_name":"Countable Nondeterminism in Weighted Programming with an Application to Mechanized Foundations for Probabilistic Program Verification","publication_year":2026,"publication_date":"2026-10-29","ids":{"openalex":"https://openalex.org/W7224947349","doi":"https://doi.org/10.48550/arxiv.2610.39723"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.39723","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39723","pdf_url":"https://arxiv.org/pdf/2610.39723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.39723","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5160198799","display_name":"Sebastian K\u00f6rner","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"K\u00f6rner, Sebastian","raw_affiliation_strings":["University of Oldenburg , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oldenburg , Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138185004","display_name":"Oliver B\u00f8ving","orcid":"https://orcid.org/0009-0009-4702-2876","observed_orcids":["https://orcid.org/0009-0009-4702-2876"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B\u00f8ving, Oliver Emil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089189715","display_name":"Christoph Matheja","orcid":"https://orcid.org/0000-0001-9151-0441","observed_orcids":["https://orcid.org/0000-0001-9151-0441"]},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matheja, Christoph","raw_affiliation_strings":["University of Oldenburg , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oldenburg , Germany","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.0017000000225380063,"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/T10533","display_name":"Teaching and Learning Programming","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/weakest-preconditions","display_name":"weakest preconditions","score":0.765999972820282},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7910000085830688},{"id":"https://openalex.org/keywords/modules","display_name":"modules","score":0.4000000059604645},{"id":"https://openalex.org/keywords/combinatorial-games","display_name":"combinatorial games","score":0.9229999780654907},{"id":"https://openalex.org/keywords/fixed-point-characterization","display_name":"fixed point characterization","score":0.7310000061988831},{"id":"https://openalex.org/keywords/soundness","display_name":"soundness","score":0.6200000047683716},{"id":"https://openalex.org/keywords/lean-theorem-prover","display_name":"Lean theorem prover","score":0.7789999842643738},{"id":"https://openalex.org/keywords/mechanized-verification","display_name":"mechanized verification","score":0.531000018119812}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7044000029563904},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.7035999894142151},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6945000290870667},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5559999942779541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49160000681877136},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.44839999079704285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.439300000667572},{"id":"https://openalex.org/C192465680","wikidata":"https://www.wikidata.org/wiki/Q1413450","display_name":"Precondition","level":2,"score":0.43700000643730164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4320000112056732},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3944000005722046},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.38190001249313354},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3515999913215637},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3034999966621399},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30160000920295715},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.2702000141143799},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.39723","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39723","pdf_url":"https://arxiv.org/pdf/2610.39723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.39723","doi":"https://doi.org/10.48550/arxiv.2610.39723","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.39723","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.39723","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.39723","pdf_url":"https://arxiv.org/pdf/2610.39723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224947349.pdf","grobid_xml":"https://content.openalex.org/works/W7224947349.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4225120439","https://openalex.org/W4226085963","https://openalex.org/W4381894290","https://openalex.org/W4390831219","https://openalex.org/W7203882421","https://openalex.org/W3174339754","https://openalex.org/W6944274836","https://openalex.org/W3119972339","https://openalex.org/W4417456724","https://openalex.org/W3096247409"],"abstract_inverted_index":{"Weighted":[0],"programming":[1,52,191,216,234],"is":[2,93,111,141],"a":[3,133,174,183,247],"framework":[4,73,192,217],"by":[5,166],"Batz":[6],"et":[7],"al.":[8],"for":[9,96,136,208,232],"describing":[10],"mathematical":[11],"models":[12],"or":[13],"optimization":[14],"problems":[15],"as":[16],"imperative":[17],"programs":[18,42,63,82,98,140],"parametrized":[19,65],"over":[20,66,103],"semirings":[21],"and":[22,43,57,83,101,170,218],"then":[23],"analyzing":[24],"them":[25],"with":[26,53,99,143,259],"program":[27,119],"verification":[28],"techniques":[29],"like":[30],"weakest":[31,195],"precondition":[32,196],"calculi.":[33],"Applications":[34],"include":[35],"reasoning":[36,75,137],"about":[37,76,84,138],"expected":[38,77,253],"outcomes":[39],"of":[40,46,69,80,87,125,153,185,188,202,239,246,251],"probabilistic":[41,81,233],"competitive":[44],"analysis":[45],"online":[47],"algorithms.":[48],"We":[49,128,198,211],"extend":[50],"weighted":[51,97,139,154,190,215],"(1)":[54,100],"countable":[55,126,260],"nondeterminism":[56],"(2)":[58,102],"user-defined":[59],"additive":[60],"rewards,":[61],"where":[62],"are":[64],"modules":[67,105],"instead":[68],"semirings.":[70],"The":[71],"resulting":[72],"enables":[74],"resource":[78],"consumption":[79],"optimal":[85],"scores":[86],"combinatorial":[88],"games.":[89],"A":[90],"technical":[91],"challenge":[92],"that":[94,113,161,182],"wp-calculi":[95],"arbitrary":[104],"can":[106],"be":[107],"unsound,":[108],"because":[109],"it":[110],"well-known":[112],"continuity":[114],"properties":[115],"commonly":[116],"used":[117],"in":[118,122,151,223,255],"semantics":[120],"break":[121],"the":[123,189,200,224,237,242],"presence":[124],"nondeterminism.":[127,261],"study":[129],"conditions":[130],"under":[131],"which":[132],"wp-style":[134],"transformer":[135],"sound":[142,194],"respect":[144],"to":[145,236],"an":[146],"operational":[147],"ground":[148],"truth":[149],"defined":[150],"terms":[152],"decision":[155,164,257],"processes":[156,165,258],"(WDPs)":[157],"-":[158],"transition":[159,168],"systems":[160],"generalize":[162],"Markov":[163,256],"drawing":[167],"weights":[169],"state":[171],"rewards":[172,254],"from":[173],"module.":[175],"Based":[176],"on":[177],"those":[178],"conditions,":[179],"we":[180],"show":[181],"range":[184],"concrete":[186],"instances":[187],"enjoy":[193],"reasoning.":[197],"demonstrate":[199],"usefulness":[201],"our":[203,213,219,240],"wp-semantics":[204],"through":[205],"case":[206],"studies":[207],"different":[209],"modules.":[210],"mechanized":[212,244],"extended":[214],"main":[220],"soundness":[221],"results":[222,231],"interactive":[225],"theorem":[226],"prover":[227],"Lean.":[228],"Instantiating":[229],"these":[230],"yields,":[235],"best":[238],"knowledge,":[241],"first":[243],"proof":[245],"fixed":[248],"point":[249],"characterization":[250],"minimal":[252]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-10-31T00:00:00"}