Gert Smolka: Doctoral Students

Gert Smolka: Doctoral Students

Saarland University Computer Science

  1. Dominik Kirst, 2023
    Mechanized Metamathematics, An Investgation of First-Order Logic and Set Theory in Constructive Type Theory.

  2. Yannick Forster, 2021
    Computability in Constructive Type Theory.

  3. Kathrin Stark, 2020
    Mechanising Syntax with Binders in Coq.

  4. Steven Schäfer, 2019
    Engineering of Formal Systems in Constructive Type Theory.

  5. Jonas Kaiser, 2019
    Formal Verification of the Equivalence of System F and the Pure Type System L2.

  6. Sigurd Schneider, 2018
    A Verified Compiler for a Linear Imperative/Functional Intermediate Language.
    (Co-supervisor: Sebastian Hack)

  7. Christian Doczkal, 2016
    A Machine-Checked Constructive Metatheory of Computation Tree Logic.

  8. Mark Kaminski, 2012
    Incremental Decision Procedures for Modal Logic with Nominals and Eventualities.

  9. Mathias Möhl, 2010,
    Dynamic Programming based RNA Pseudoknot Alignment.

  10. Guido Tack, 2009,
    Constraint Propagation -- Models, Techniques, Implementation.
    Won ACP Doctoral Research Award 2010.

  11. Marco Kuhlmann, 2007,
    Dependency Structures and Lexicalized Grammars.
    Won E.W. Beth Dissertation Prize 2008.

  12. Andreas Rossberg, 2007,
    Typed Open Programming.

  13. Leif Kornstaedt, 2006,
    Design and Implementation of a Programmable Middleware.

  14. Ralph Debusmann, 2006,
    Extensible Dependency Grammar --- A Modular Grammar Formalism Based On Multigraph Description.

  15. Alexander Koller, 2004,
    Constraint-based and Graph-based Resolution of Ambiguities in Natural Language.

  16. Tim Priesnitz, 2004,
    Subtype Satisfiability and Entailment.
    (Co-supervisor: Joachim Niehren)

  17. Katrin Erk, 2002,
    Parallelism Constraints in Underspecified Semantics.

  18. Tobias Müller, 2001,
    Constraint Propagation in Mozart.

  19. Christian Schulte, 2000,
    Programming Constraint Services.

  20. Michael Mehl, 1999,
    The Oz Virtual Machine: Records, Transients, and Deep Guards.

  21. Ralf Scheidhauer, 1999,
    Design, Implementierung und Evaluierung einer virtuellen Maschine für Oz.

  22. Joachim Paul Walser, 1998,
    Domain-independent Local Search for Linear Integer Optimization.

  23. Martin Müller, 1998,
    Set-based Failure Diagnosis for Concurrent Constraint Programming.

  24. Jörg Würtz, 1998,
    Lösen kombinatorischer Probleme mit Constraintprogrammierung in Oz.

  25. Martin Henz, 1997,
    Objects in Oz.

  26. Joachim Niehren, 1995,
    Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen.

  27. Rolf Backofen, 1994,
    Expressivity and Decidability of First-order Languages over Feature Trees.

  28. Andreas V. Hense, 1994,
    Polymorphic Type Inference for Object-oriented Pogramming Languages.

Legal notice, Privacy policy