Efficient manipulation of Boolean functions is one of the building blocks of many algorithms in the area of formal methods and exhaustive model analysis (for example in the case of Boolean networks in systems biology). Currently, there are libraries developed for this purpose that are using a wide range of data structures across many languages [1,2,3]. However, they are often not feature-complete or suffer from poor performance.

The goal of this thesis is to develop a library in the Rust programming language that:

• Supports manipulation of Boolean functions represented as (a) expressions, (b) tables, (c) binary decision diagrams;
• Can be used from Python using the PyO3 tool [4];
• Supports a reasonable subset of the relevant functionality provided by the state-of-the-art Python libraries PyEDA and SymPy [5, 6];
• Is reasonably performant compared to the other Python counterparts on a set of benchmarks selected by the student.

[1] https://pyeda.readthedocs.io/en/latest/
[2] https://crates.io/crates/bex
[3] https://crates.io/crates/biodivine-lib-bdd
[4] https://pyo3.rs/v0.18.1/
[5] https://pyeda.readthedocs.io/en/latest/
[6] https://www.sympy.org/en/index.html