miniBDD – a Minimalistic BDD Library
miniBDD is a very lightweight BDD library for teaching purposes. It's not very efficient (the nodes use too much memory), and it is missing a lot of features (e.g., dynamic variable reordering). The main point is that miniBDD is only about 600 lines of C++ code, and does not make use of any low-level programming. All data structures are instances of STL templates.
miniBDD 0.1 released.
We provide two sets of slides:
- slides.pdf: a set of slides (PDF) describing the implementation of miniBDD.
- bdds.pdf: these slides provide a general introduction to BDDs.
The archive contains the source of the library, a Makefile, and an example.