Verifying BDD algorithms through monadic interpretation
From MaRDI portal
Recommendations
Cited in
(9)- Reachability programming in HOL98 using BDDs
- Reflecting BDDs in Coq
- Monadic Sequence Testing and Explicit Test-Refinements
- Searching for mutual exclusion algorithms using BDDs
- BDD-based symbolic model checking
- Imperative Functional Programming with Isabelle/HOL
- Monotonicity Analysis Can Speed Up Verification
- A BDD-like implementation of an automata package
- Theorem Proving in Higher Order Logics
This page was built for publication: Verifying BDD algorithms through monadic interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736996)