Verifying BDD Algorithms through Monadic Interpretation
Abstract elided by the publisher.
Related papers
- Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl) ICFP 2026
- BDD4BNN: A BDD-Based Quantitative Analysis Framework for Binarized Neural Networks CAV 2021
- Mona: Monadic Second-Order Logic in Practice TACAS 1995
- Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms CAV 2023
- WasmRef-Isabelle: A Verified Monadic Interpreter and Industrial Fuzzing Oracle for WebAssembly PLDI 2023
- Abstract Interpreters: A Monadic Approach to Modular Verification ICFP 2024
- Verified symbolic execution with Kripke specification monads (and no meta-programming) ICFP 2022
- An n log n Algorithm for Online BDD Refinement CAV 1997