Steffan Sølvsten
Steffan Sølvsten
When one applies _~_ on an unreduced BDD, i.e. on the `__bdd` class, then it is first reduced and then the _negation flag_ is set to _true_. ```cpp bdd operator~...
The function `__prod2_2level_upper_bound(in_0, in_1, op)` in `prod2` used to derive an upper bound by combining both 1-level and 2-level cuts information does not in our unit tests beat the purely...
With the *prediction precision ratio* (PPR) we tried to accumulate some average. Yet, essentially we have done so with something akin to an arithmetic mean. What we should have done...
With #237 we made it possible to push to the *root* level of the *levelized priority queue*. This makes it possible to replace all of the root initialisation logic for...
### Introduction The PolyBoRi library [Brickenstein09] implements Polynomials over the Boolean Ring with ZDDs. To the best of my knowledge, this approach in PolyBoRi is the best approach we have,...
All other decision diagrams up to this point have had their nodes represent an *if-then-else* on the variable. In a *Functional Decision Diagram* (FDD) the semantics of a node is...
One of the main issues with using the classical types of Decision Diagrams is that in practice they only work for up to a hundred(ish) variables. This is primarily due...
The most successful approach for variable reordering in conventional BDD packages is the sifting algorithm. This algorithm depends on the ability to efficiently swap two neighbouring variables. ## Preliminary Issues...
When running the following benchmarks with the minimum of 128 MiB of memory, we get the following error message. ``` Resource memory limit exceeded by _MiB (_%), while trying to...
There is this [VS Code Plugin](https://github.com/dampsoft/vscode-banditcpp-test-adapter) that allows you to integrate our [Bandit-C++](https://github.com/banditcpp/bandit) tests straight into the VS Code IDE. - [ ] Set up the [VS Code Plugin](https://github.com/dampsoft/vscode-banditcpp-test-adapter) and...