Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary
arXiv 2607.16533•5fa4165847b7867c0ce48f9e7fc5c4496807ccf2594cfa2afafea6d233459508
CHCETASIsabelle/HOLLean 4WebAssemblyagent systems','authorization','trace monitoring' ,"effect typesbecause-calculuscategorical semanticsconstrained Horn clausesdistributive lawsdowngradingeffect handlersindirect callsinformation flowmodal type theorynon-interferenceoblivious adversaryopOLoutcome logicpanic handler summarizationparametric information flowprobabilistic separation logicprobabilistic verificationrely-guaranteeresumption
Paper metadata
- arXiv ID
- 2607.16533
- Version
- Not specified by this published record
- Category
- Computer Science — Programming Languages (cs.PL)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 5fa4165847b7867c0ce48f9e7fc5c4496807ccf2594cfa2afafea6d233459508
- Enrichment time
- 2026-07-21T08:52:02Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.