Theoretical Computer Science

Teaching

Winter Term 2017/2018

• Vorlesung: Programmanalyse
  ist eine Bachelor-Wahlpflichtvorlesung bzw. Master-Vorlesung (2+2, 5 LP) in Theoretischer Informatik.
• Lecture: Algebraic Automata Theory
  is a Master's course (4+2, 10 LP) in Theoretical Computer Science.
• Lecture: Complexity Theory
  is a Master's course (4+2, 10 LP) in Theoretical Computer Science.
• Lecture: Concurrency Theory
  is a Master's course (4+2, 10 LP) in Theoretical Computer Science.
• Vorlesung: Theoretische Informatik I
  ist eine Bachelor-Pflichtvorlesung (2+2, 5 LP) in Theoretischer Informatik.
• Seminar: Automata Theory and Games
  is a Bachelor's and Master's seminar.
• Project: Automata Learning
  is a "Teamprojekt" for Bachelor students respectively a "Praktikum" for Master students.

Past Courses

• Lecture: Algorithmic Automata Theory - Summer 2017
• Lecture: Automata Theory - Summer 2017, Winter 2013/14, Winter 2014/15, Winter 2012/13, Summer 2011
• Lecture: Complexity Theory - Winter 2016/17, Winter 2015/16
• Lecture: Concurrency Theory - Winter 2016/17, Summer 2015, Summer 2014, Winter 2011/12, Winter 2010/11
• Lecture: Games with Perfect Information - Summer 2017
• Vorlesung: Bäume, Ordnungen und Anwendungen - Winter 2015/16, Winter 2013/14
• Vorlesung: Einführung in die Logik - Summer 2017
• Vorlesung: Formale Grundlagen der Programmierung - Summer 2016
• Vorlesung: Kryptologie III - Summer 2017
• Vorlesung: Logik - Summer 2016, Summer 2015, Summer 2014, Summer 2013, Summer 2012
• Vorlesung: Theoretische Informatik I - Winter 2016/17
• Vorlesung: Theoretische Informatik II - Summer 2017
• Seminar - Summer 2017 (Programming & Logics), Winter 2016/17 (Automata), Summer 2014 (Logics)
• SEP - Summer 2017 (UnicornPL)
• Praktikum: Kryptologie 1+2 - Summer 2017

Theses

Master's Theses:

• 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. [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.

Bachelor's Theses:

• 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.