Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning
Jialu Bao, Emanuele D'Osualdo, Azadeh Farzan
Abstract
We present BlueBell , a program logic for reasoning about probabilistic programs where unary and relational styles of reasoning come together to create new reasoning tools. Unary-style reasoning is very expressive and is powered by foundational mechanisms to reason about probabilistic behavior like independence and conditioning . The relational style of reasoning, on the other hand, naturally shines when the properties of interest compare the behavior of similar programs (e.g. when proving differential privacy) managing to avoid having to characterize the output distributions of the individual programs. So far, the two styles of reasoning have largely remained separate in the many program logics designed for the deductive verification of probabilistic programs. In BlueBell , we unify these styles of reasoning through the introduction of a new modality called “joint conditioning” that can encode and illuminate the rich interaction between conditional independence and relational liftings ; the two powerhouses from the two styles of reasoning.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 53d06e71-6573-4804-a47e-66636478c02cCited by top-tier papers6
- A Quantitative Probabilistic Relational Hoare LogicMartin Avanzini, Gilles Barthe, Davide Davoli, Benjamin GrégoirePOPL 2025 · 9 citations
- Approximate Relational Reasoning for Higher-Order Probabilistic ProgramsPhilipp G. Haselwarter, Kwing Hei Li, Alejandro Aguirre, Simon Oddershede Gregersen et al.POPL 2025 · 8 citations
- Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and InvariantsNoam Zilberstein, Alexandra Silva, Joseph TassarottiPOPL 2026 · 4 citations
- Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded AssertionsGilles Barthe, Minbo Gao, Jam Kabeer Ali Khan, Matthijs Muis et al.LICS 2026 · 2 citations
- RapunSL: Untangling Quantum Computing with Separation, Linear Combination and MixingYusuke Matsushita, Kengo Hirata, Ryo Wakizaka, Emanuele D'OsualdoPOPL 2026 · 1 citation
Builds on10
- The future is ours: prophecy variables in separation logicRalf Jung, Rodolphe Lepigre, Gaurav Parthasarathy, Marianna Rapoport et al.POPL 2020 · 62 citations
- A probabilistic separation logicGilles Barthe, Justin Hsu, Kevin LiaoPOPL 2020 · 35 citations
- This is the moment for probabilistic loopsMarcel Moosbrugger, Miroslav Stankovic, Ezio Bartocci, Laura KovácsOOPSLA 2022 · 30 citations
- A pre-expectation calculus for probabilistic sensitivityAlejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski et al.POPL 2021 · 24 citations
- Asynchronous Probabilistic Couplings in Higher-Order Separation LogicSimon Oddershede Gregersen, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti et al.POPL 2024 · 23 citations
Related papers
- Lilac: A Modal Separation Logic for Conditional ProbabilityJohn M. Li, Amal Ahmed, Steven HoltzenPLDI 2023 · 22 citations
- Relational proofs for quantum programsGilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu et al.POPL 2020 · 29 citations
- A Bunched Logic for Conditional IndependenceJialu Bao, Simon Docherty, Justin Hsu, Alexandra SilvaLICS 2021 · 15 citations
- Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious AlgorithmsPengbo Yan, Toby Murray, Olga Ohrimenko, Van-Thuan Pham et al.FM 2024 · 2 citations
- Outcome Logic: A Unifying Foundation for Correctness and Incorrectness ReasoningNoam Zilberstein, Derek Dreyer, Alexandra SilvaOOPSLA 2023 · 39 citations
