Samuel Teuber
Samuel Teuber
About Me
Research
Teaching
Blog
Formal Methods
An Information-Flow Perspective on Algorithmic Fairness
An exploration of the relationships between qualitative and quantitative information flow and various causal and non-causal fairness definitions with applications to program analysis.
Samuel Teuber
,
Bernhard Beckert
PDF
Cite
Code
Poster
Provably Safe Neural Network Controllers via Differential Dynamic Logic
We present the first approach for the combination of differential dynamic logic (dL) and NN verification. By joining forces, we can exploit the efficiency of NN verification tools while retaining the rigor of dL. This yields infinite-time horizon safety guarantees for neural network control systems.
Samuel Teuber
,
Stefan Mitsch
,
André Platzer
PDF
Cite
Project
Quantifying Software Correctness by Combining Architecture Modeling and Formal Program Analysis
A formal approach for the quantiative assessment of service-oriented software which combines high-level software architecture modelling with deductive verification.
Florian Lanzinger
,
Christian Martin
,
Frederik Reiche
,
Samuel Teuber
,
Robert Heinrich
,
Alexander Weigl
PDF
Cite
DOI
Formally Verified Algorithmic Fairness using Information-Flow Tools (Extended Abstract)
We demonstrate preliminary results on strong connections between Information Flow and Algorithmic Fairness Analysis
Samuel Teuber
,
Bernhard Beckert
PDF
Cite
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
Samuel Teuber
,
Marko Kleine Büning
,
Philipp Kern
,
Carsten Sinz
PDF
Cite
Code
Experiments
DOI / IEEE Xplore
Quantifying Software Reliability via Model-Counting
We present and evaluate a pipeline allowing for the quantification of C-programs according to their specification adherence.
Samuel Teuber
,
Alexander Weigl
PDF
Cite
Code
Video
Experiments
DOI / Springer
Solving difficult SMT instances using abstractions and incremental SMT solving
Bachelor Thesis
GitHub
Bachelor Thesis
Publication
Cite
×