Formal Methods

Geometric Path Enumeration for Equivalence Verification of Neural Networks

We present and evaluate an approach for proving equivalence properties on neural networks and show that the verification of $\epsilon$-equivalence is coNP-complete

Quantifying Software Reliability via Model-Counting

We present and evaluate a pipeline allowing for the quantification of C-programs according to their specification adherence.

Solving difficult SMT instances using abstractions and incremental SMT solving

Bachelor Thesis