A Demonic Outcome Logic for Randomized Nondeterminism

N Zilberstein, D Kozen, A Silva… - Proceedings of the ACM on …, 2025 - dl.acm.org
Programs increasingly rely on randomization in applications such as cryptography and
machine learning. Analyzing randomized programs has been a fruitful research direction …

Tachis: Higher-Order Separation Logic with Credits for Expected Costs

PG Haselwarter, KH Li, M de Medeiros… - Proceedings of the …, 2024 - dl.acm.org
We present Tachis, a higher-order separation logic to reason about the expected cost of
probabilistic programs. Inspired by the uses of time credits for reasoning about the running …

Approximate Relational Reasoning for Higher-Order Probabilistic Programs

PG Haselwarter, KH Li, A Aguirre… - Proceedings of the …, 2025 - dl.acm.org
Properties such as provable security and correctness for randomized programs are naturally
expressed relationally as approximate equivalences. As a result, a number of relational …

Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants

N Zilberstein, A Silva, J Tassarotti - arXiv preprint arXiv:2411.11662, 2024 - arxiv.org
Although randomization has long been used in concurrent programs, formal methods for
reasoning about this mixture of effects have lagged behind. In particular, no existing …

An Iris for Expected Cost Analysis

J Lohse, D Garg - arXiv preprint arXiv:2406.00884, 2024 - arxiv.org
We present ExpIris, a separation logic framework for the (amortized) expected cost analysis
of probabilistic programs. ExpIris is based on Iris, parametric in the language and the cost …