Completed dissertations, master's theses and bachelor's theses

PhD

Marco Sälzer, The Complexity of Formal Verification of Neural Network-Based Models, 2025

Daniel Kernberger, Hybrid Branching-Time Logics, 2019

Florian Bruse, Extremal Fixpoints for Higher-Order Modal Logic, 2018

Milka Hutagalung, Buffered Simulation for Büchi Automata, 2018

MSc

Lars-Eric Marquardt, On the Relative Expressiveness of HyperLTL and the Polyadic μ-Calculus, 2026

Sören Möller, Categorizing Functions in Natural Science Experiments, 2025

Lukas Mentel, PDR and SMT2 for Formal Verification of Embedded Systems, 2024

Maurice Herwig, Using Shared Packet Parse Forests to Compute All Minimal Corrections, 2024

Georg Siebert, Randomized Smoothing for Time-Aware Robustness of Temporal Graph Neural Networks, 2024

Eric Alsmann, On the Undecidability of the Output Reachability Problem for Transformer Sequence Classifiers, 2023

Marco Sälzer, Convergence of Modal Fixpoint Forms over Special Classes of Structures, 2020

Adrian Sturm, Constructing a Model-Checking Algorithm for Higher-Order Modal Logic Using Binary Decision Diagrams, 2019

Benedikt Hruschka, Implementation of an Interactive Model Checker for First-Order Logic over Automated Structures, 2019

David Kronenberger, Capturing Bisimulation-Invariant Complexity Classes Using Polyadic Higher-Order Fixpoint Logic, 2019

Lara Yörük, SoPHY – A Specification Language for Hybrid Systems, 2017

Orcun Yörük, Simon – A Simulation Tool for Hybrid Systems, 2017

Arno Ehle, Proof Search in the Sequent Calculus for First-Order Logic with Equality, 2017

BSc

Tobias Stuhldreier, User-Driven Error Correction for Context-Free Languages, 2026

Jana Melani Klitzsch, Model Checking Metric for First-Order Temporal Logic over Dynamic Graphs, 2025

Ahmad Lowejatan Noori, Analysing the Expressive Power of State-Space Models via RASP Programs, 2025

Nathanael Schmidt, An Extension of the DiMo Tool to Support Other Data Types, 2025

Laurin Pöppe, Implementation of a Translation of Neural Networks into I/O-Equivalent Finite Automata, 2024

Adrian Nestroinai, Development of a TeachingBook Component to Support the Learning of Formal Grammars, 2024

Jan Heinemeyer, Hypothesis Testing in Biology: Extension and Integration of the Calculus of Influence into a Teaching/Learning System for Hypothesis Testing, 2023

John Hundhausen, A Website Builder for Interactive Lecture Notes and Worksheets, 2023

Clemens Weiße, Front-end development of a reduction trainer for students, 2023

Lars-Eric Marquardt, Formal Verification of Different Semantics for an Abstract Higher-Order Fixpoint Algebra in Isabelle/HOL, 2022

Kathrin Lehmann, Tool-Supported Learning in the Context of Computability Theory: A Backend Prototype for Automated Verification of Reductions, 2022

Stefan Kablowski, Computing All Minimal Corrections for a Word to Match a Context-Free Description, 2022

Sören Möller, An Efficient Algorithm for Proof Search in the Calculus of Influence, 2022

Maurice Herwig, Computing a Weighting of Regular Languages, 2021

Georg Siebert, Toward an Artificial Teaching Assistant: Learning Evaluation Schemas for Finite Automata with GNNs, 2021

Eric Alsmann, Inexpressibility Results for Propositional Dynamic Logic over Context-Free Programs, 2021

Jan Müller, A Web Application for Predicate Logic Model Checking of Graph Structures, 2021

Lukas Mentel, Detection and Elimination of Constants to Strengthen k-Induction, 2021

Marco Sälzer, Neededness Analysis for Model-Checking Properties Defined by Order-2 Fixpoints, 2018

Arno Ehle, Investigations into Partial Reductions of Parity Games to Büchi Games, 2015

Thorsten Löbig, Investigations into the Applicability of Formal Methods Using the Example of an Infusion Pump, 2014

Michael Falk, Fixpoint Iteration for Parity Games, 2013