Implementation of the Binary Decision Diagrams in Racket
-
Updated
Nov 17, 2016 - Racket
Implementation of the Binary Decision Diagrams in Racket
Multithreaded solution for determining (stepwise) reachability between two nodes within some Binary Decision Diagram (BDD).
An decision tree implemented in React
metaSMT-Based SMT-LIB2 Consistency Checker
Automated Reasoning course project - Binary Decision Diagrams C++ implementation and paper (in Serbian)
MopedQLeak: Tool for Quantifying Information Flow in Probabilistic Recursive Programs
Functional Programming in Concurrent and Distributed Systems couse in Erlang
A static-library version of the famous CUDD (Colorado University Decision Diagram) library.
Java BDD implementation based on hashmaps.
Demonstration of BDD-based SAT solver that generates checkable proofs of unsatisfiability. Details provided in paper: R. E. Bryant and M. J. H. Heule, "Generating Extended Resolution Proofs in a BDD-based SAT Solver," TACAS 2021
Python abstraction around Binary Decision Diagrams to implement Multivalued Decision Diagrams.
Identity suppressed decision diagrams (IDDs)
Binary Decision Diagram Package using a Chord-Based Distributed Hash Table
A Python (re-)implementation of some known knowledge compilers
Mirror of: CUDD: Colorado University Decision Diagram package <http://vlsi.colorado.edu/~fabio/>
A tool for evaluating secure information flow of concurrent probabilistic programs
🗝 使用二元决策图(BDD)和 BuDDy 库解决二维且带有胶合的的爱因斯坦谜题
Formal verification of the Adiar BDD package
Add a description, image, and links to the binary-decision-diagrams topic page so that developers can more easily learn about it.
To associate your repository with the binary-decision-diagrams topic, visit your repo's landing page and select "manage topics."