Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary
2026-07-21T08:52:02Z•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
What happened
Collection of new PL/formal-methods papers (arXiv 21 Jul 2026) covering advances in probabilistic and adversarial program verification, automated verification for WebAssembly, unified information-flow/type-theory approaches to downgrading, effect/handler calculi, algebraic reasoning for rely/guarantee concurrency, an effect-typed language for agent systems, martingale-based ω‑regular verification, parameterized verification for MPI programs, a tensor/Einsum language for graph algorithms, composable verification pipelines for multi-agent systems, and AST-based LLM theorem-proving agents. Noted,
Why it matters
A reviewed impact interpretation has not been published for this record.
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.