Teaching
Winter Term 2018/2019
Lecture notes
Past Courses
-
Algebraic Automata Theory -
Winter 2017/18.
-
Algorithmic Automata Theory -
Summer 2018,
Summer 2017,
Summer 2016,
Winter 2013/14,
Winter 2014/15,
Winter 2012/13,
Summer 2011.
-
Programmanalyse -
Winter 2017/18,
Winter 2015/16 (BOA),
Winter 2013/14 (BOA).
-
Complexity Theory -
Winter 2017/18,
Winter 2016/17,
Winter 2015/16.
-
Concurrency Theory -
Winter 2017/18,
Winter 2016/17,
Summer 2015,
Summer 2014,
Winter 2011/12,
Winter 2010/11.
-
Games with Perfect Information -
Summer 2018,
Summer 2017.
-
Logik -
Summer 2018,
Summer 2017,
Summer 2016,
Summer 2015,
Summer 2014,
Summer 2013,
Summer 2012.
-
Semantics -
Summer 2018.
-
Seminar -
Summer 2018,
Winter 2017/18,
Summer 2017,
Winter 2016/17,
Summer 2014.
-
SEP -
Summer 2018 (Hack your habits),
Summer 2017 (UnicornPL).
-
Teamprojekt / Praktikum -
Summer 2018 (Programmanalyse),
Winter 2017/18 (Automata Learning),
Summer 2017 (Kryptologie).
-
Theoretische Informatik 1 -
Winter 2017/18,
Winter 2016/17,
Summer 2016 (FGdP).
-
Theoretische Informatik 2 -
Summer 2018,
Summer 2017.
Theses
We offer Bachelor's and Master's thesis on latest research results. Visit us and we'll talk about a subject!
Topics currently available:
-
Bachelor's Thesis in Logic:
Implementing the tableau method for sequences of user-supplied formulae,
allowing for different strategies for building the tableaus resp. the satisfying valuations to be compared;
should use a GUI and be platform-independent;
intended as a tool for use in future versions of the logic lecture.
Contact: Jürgen Koslowski
-
Bachelor's or Master's Thesis in Logic:
An analysis of different heuristics for the Davis-Putnam algorithm;
needs a testbed for comparing these on equal footing.
Contact: Jürgen Koslowski
Past Master's Theses:
-
Sören van der Wall:
tba.
TU Braunschweig, 2018.
-
Pascal Baumann:
tba.
TU Braunschweig, 2018.
-
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.
[PDF]
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.
[PDF]
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.
[PDF]
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.
[PDF]
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.
[PDF]
University of Oldenburg, 2008.
-
Tim Strazny: Entwurf und Implementierung von Algorithmen zur Berechnung von Petrinetz-Semantiken für Pi-Kalkül-Prozesse.
[PDF]
University of Oldenburg, 2007.
Past Bachelor's Theses:
-
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.
-
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.
[PDF]
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.
[PDF]
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.
[PDF]
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.
