Teaching

Winter Term 2026/27

Title	Module Type	Credits	Degree
Theoretical Computer Science 1	Lecture (mandatory)	5	Bachelor's
Models of Computation	Lecture (elective)	5	Bachelor's
Team Projekt	Team Projekt	5	Bachelor's
Introduction to Logics	Retry Exam	5	Bachelor's
Seminar	Seminar	5	Bachelor's/Master's
Program Analysis	Lecture (elective)	5	Bachelor's/Master's
Program Analysis Lab	Lab	5	Bachelor's/Master's
Games with perfect Information	Lecture (elective)	5	Master's
Semantics	Lecture (elective)	10	Master's

Summer Term 2026

Title	Module Type	Credits	Degree
Introduction to Logics	Lecture (mandatory)	5	Bachelor's
Theoretical Computer Science 1	Retry Exam	5	Bachelor's
Concurrent Programming	Lecture (elective)	5	Bachelor's
Advanced Topics in Verification	Lecture (elective)	5	Master's
Concurrency Theory	Lecture (elective)	10	Master's
SEP: Automaton Defense	SEP	7	Bachelor's
Team Projekt	Team Projekt	5	Bachelor's
Seminar	Seminar	5	Bachelor's/Master's

Winter Term 2025/26

Title	Module Type	Credits	Degree
Theoretical Computer Science 1	Lecture (mandatory)	5	Bachelor's
Introduction to Logics	Retry Exam	5	Bachelor's
Models of Computation	Lecture (elective)	5	Bachelor's
Program Analysis	Lecture (elective)	5	Bachelor's/Master's
Program Analysis Lab	Lab	5	Bachelor's/Master's
Seminar	Seminar	5	Bachelor's/Master's
Algorithmic Automata Theory	Lecture (elective)	10	Master's
Games with Perfect Information	Lecture (elective)	5	Master's

Past Courses

Title	Module Type	Credits	Degree
Introduction to Logic	Lecture (mandatory)	5	Bachelor's
Theoretical Computer Science 1	Retry Exam	5	Bachelor's
ChatPBE - Interactive Programming By Example Solver	SEP	7	Bachelor's
Team Project	Team Project	5	Bachelor's
Seminar	Seminar	5	Bachelor's/Master's
Complexity Theory	Lecture (elective)	10	Master's
Concurrency Theory	Lecture (elective)	10	Master's
Semantics	Lecture (elective)	10	Master's

Title	Module Type	Credits	Degree
Theoretical Computer Science 1	Lecture (mandatory)	5	Bachelor's
Introduction to Logic	Retry Exam	5	Bachelor's
Theoretical Computer Science 2	Retry Exam	5	Bachelor's
Seminar	Seminar	5	Bachelor's/Master's
Algorithmic Automata Theory	Lecture (elective)	10	Master's
Games with Perfect Information	Lecture (elective)	5	Master's
Program Analysis Lab	Lab	5	Master's

Title	Module Type	Credits	Degree
Introduction to Logic	Lecture (mandatory)	5	Bachelor's
Theoretical Computer Science 2	Lecture (mandatory)	5	Bachelor's
Seminar	Seminar	5	Bachelor's/Master's
Concurrency Theory	Lecture (elective)	10	Master's

Algebraic Automata Theory	Winter 2018/19, Winter 2017/18
Algorithmic Automata Theory	Summer 2021, Summer 2019, Summer 2018, Summer 2017,Summer 2016, Winter 2013/14, Winter 2014/15, Winter 2012/13, Summer 2011
Program Analysis	Winter 2018/19, Winter 2017/18, Winter 2015/16 (BOA), Winter 2013/14 (BOA)
Complexity Theory	Winter 2021/22, Winter 2018/19, Winter 2017/18, Winter 2016/17, Winter 2015/16
Concurrency Theory	Winter 2021/22, Winter 2020/21, Winter 2019/20, Winter 2018/19, Winter 2017/18, Winter 2016/17, Summer 2015, Summer 2014, Winter 2011/12, Winter 2010/11
Games with Perfect Information	Summer 2019, Summer 2018, Summer 2017
Introduction to Logic	Summer 2023, Summer 2022, Summer 2021, Summer 2020, Summer 2019, Summer 2018,Summer 2017, Summer 2016, Summer 2015, Summer 2014, Summer 2013, Summer 2012
Semantics	Winter 2019/20, Summer 2018
Seminar	Summer 2023, Winter 2022/23, Summer 2022, Winter 2021/22, Summer 2021, Winter 2020/21, Summer 2020, Winter 2019/20, Summer 2019, Winter 2018/19, Summer 2018, Winter 2017/18, Summer 2017, Winter 2016/17, Summer 2014
SEP	Summer 2020 (KittyCAT), Summer 2019 (Kitchen App), Summer 2018 (Hack your habits),Summer 2017 (UnicornPL)
Team Project / Lab	Summer 2019 (Programmanalyse), Winter 2018/19 (Program Verification), Summer 2018 (Programmanalyse), Winter 2017/18 (Automata Learning), Summer 2017 (Kryptologie)
Theoretical Computer Science 1	Winter 2022/23, Winter 2021/22, Winter 2020/21, Winter 2019/20,Winter 2018/19, Winter 2017/18, Winter 2016/17, Summer 2016 (FGdP)
Theoretical Computer Science 2	Summer 2023, Summer 2022, Summer 2021, Summer 2020, Summer 2019, Summer 2018, Summer 2017

Lecture Notes

Theses

We offer Bachelor's and Master's thesis on latest research results. Visit us and we'll talk about a subject!

Lasse Karls	Finding memory model related bugs in database applications.	TU Braunschweig	2025
Natalia Gacek	An Online Solver for Consistency as a Theory.	TU Braunschweig	2025
Johannes Schmechel	Concolic Execution of Multi-threaded Assembly Programs.	TU Braunschweig	2025
Finn Thieme	Parallelisierung von Bounded-Model-Checking-Verfahren über Kommunikationsconstraints.	TU Braunschweig	2022
Jan Steiner	tba	TU Braunschweig	2021
René Maseli	Memory-Model-aware Static Analysis of Concurrent Programs.	TU Braunschweig	2021
Christian Reineke	Christian Reineke	TU Braunschweig	2020
Thomas Haas	Probabilistic Programming: Applications of Martingales beyond Reachability.	TU Braunschweig	2019
Sören van der Wall	Bounded Analysis of Concurrent and Recursive Programs.	TU Braunschweig	2019
Pascal Baumann	tba	TU Braunschweig	2019
Philip Holzhüter	Permissive Strategies for Perfect-Information Games.	TU Braunschweig	2018
Elisabeth Neumann	Algorithms for Context-free Games: A comparison of Saturation, Guess & Check and Summarization.	TU Kaiserslautern	2017
Benjamin Eichler	Verification of Publish Subscribe Systems.	TU Braunschweig	2017
Mike Becker	Runtime Verification of Sequential Consistency for ARM.	TU Braunschweig	2017
Fajar Haifani	Antichain Optimizations using Simulation Relations for Context-Free Games.	TU Kaiserslautern	2017
Martin Köhler	CEGAR for Regular Inclusion.	TU Kaiserslautern	2016
Mark Müller	Entwurf und Implementierung eines an IC3 angelehnten Verfahrens zur Prüfung von Inklusionsbeziehungen regulärer Sprachen.	TU Kaiserslautern	2016
Sebastian Wolff	Thread-Modular Reasoning for Heap-Manipulating Programs: Exploiting Pointer Race Freedom.	TU Kaiserslautern	2015
Matteo Settenvini	Algorithmic analysis of name-bounded programs.	TU Kaiserslautern	2014
Susanne Göbel	A polynomial translation of mobile ambients into safe Petri nets.	TU Kaiserslautern	2014
Florian Furbach	Automata-theoretic control for Total Store Ordering architectures.	TU Kaiserslautern	2013
Anselme Tueno	Verifikation von Netzwerkprotokollen mit Level-k-Baumersetzungssystemen.	TU Kaiserslautern	2011
Eike Möhlmann	Hiding relaxed semantics from a user - design and implementation of fence insertion algorithms for concurrent programs.	LIAFA and University of Oldenburg	2010
Sven Linker	Model checking pi-calculus against temporal connectedness properties.	University of Oldenburg	2008
Tim Strazny	Entwurf und Implementierung von Algorithmen zur Berechnung von Petrinetz-Semantiken für Pi-Kalkül-Prozesse.	University of Oldenburg	2007

Theresa Stieler	Library Semantics Under Axiomatic Memory Models.	TU Braunschweig	2024
Nico Pietzsch	Finding memory safety bugs in fine-grained concurrent programs.	TU Braunschweig	2023
Dogukan Hizir	Bug-Explanation mit Dartagnan.	TU Braunschweig	2023
Benjamin Hennies	tba	TU Braunschweig	2021
Jan Gruenke	tba	TU Braunschweig	2021
Chek-Manh Loi	tba	TU Braunschweig	2021
Edgar Schmidt	tba	TU Braunschweig	2020
Frieso Gerken	tba	TU Braunschweig	2020
Kai Harz	Good-for-Games Automaten: Ein Überblick.	TU Braunschweig	2019
Stephan Lampe	TableauWiz: Ein Tool zur Visualisierung von Varianten der aussagenlogischen Tableau-Methode.	TU Braunschweig	2019
Sophie Ketelsen	Bedrohungs- und Risikoanalyse für den Einsatz von kryptographischem Schlüsselmaterial in kritischen Infrastrukturen am Beispiel der Datenübertragung in Bahnautomatisierungssystemen.	TU Braunschweig	2019
Thomas Graave	tba	TU Braunschweig	2018
Janosch Reppnow	Compositional verification for Petri nets.	TU Braunschweig	2018
Nicolas Köcher	Automata-theoretic construction of semi-linear sets.	TU Braunschweig	2018
Volker Heberle	Simulation von Kellerautomaten, die das Ende der Eingabe erkennen, durch klassische Kellerautomaten und die Äquivalenz dieser Modelle.	TU Braunschweig	2017
Nadja Stachowiak	Splicing in Formal Language - a Survey.	TU Braunschweig	2017
Christian Reineke	Implementierung einer Testumgebung für Varianten des CYK-Algorithmus.	TU Braunschweig	2017
Felix Stutz	Operations on a Symbolic Domain for Synthesis.	TU Kaiserslautern	2017
Jakob Wenzel	Symbolic Heaps for a Thread-Modular Linearizability Analysis.	TU Kaiserslautern	2016
Albert Schimpf	Development and Implementation of a Modular SAT-Solver Framework.	TU Kaiserslautern	2016
Jonathan Kolberg	Relating Semantics.	TU Kaiserslautern	2015
Martin Köhler	Recognizability of rational sets.	TU Kaiserslautern	2014
Phoebe Buckheister	Parikh's theorem beyond pushdown automata.	TU Kaiserslautern	2013
Albert Schimpf	Wurzelberechnungen in Monoiden mit konvergenten Darstellungen.	TU Kaiserslautern	2013
Susanne Göbel	A logical characterisation of availability languages.	TU Kaiserslautern	2011
Jan Bormann	A geometric approach to the coverability problem in linear while programs.	TU Kaiserslautern	2011
Philipp Gringel	Modellierung und Verifikation eines holonischen Transportsystems mit dem Pi-Kalkül.	University of Oldenburg	2007

Teaching

Winter Term 2026/27

Summer Term 2026

Winter Term 2025/26

Past Courses

Lecture Notes

Theses

For All Visitors

For Students

Internal Tools

Contact