Professor Arnold Beckmann
Our HoD
Dr. Ulrich Berger
My traditional work areas are domain theory, proof-theory and lambda calculus. Currently, I’m mainly working on program extraction from proofs.
Dr. Jens Blanck
Dr. Xiuyi Fan
Dr. Oliver Kullmann
Dr. Liang-Ting Chen
Dr. Phillip James
Professor Faron Moller
Dr. Liam O’Reilly
Dr. Arno Pauly
Professor Markus Roggenbach
Dr. Anton Setzer
Professor John V. Tucker
Hoda Abbasizanjani
Hoda is a PhD student in Theoretical Computer Science. Her current research is about the connections of SAT (the propositional satisfiability problem) and combinatorics. The main goal of her research is to study the structure of minimally unsatisfiable clause-sets (conjunctive normal forms as set-systems) in order to understand the reasons of unsatisfiability (inconsistency).
Arved Friedemann
Research area: Extracting advanced SMT solvers from proofs
Olga Petrovska
The aim of my research is finding an efficient way of extracting programs from proofs. This is an alternative approach to software development, where correctness properties of software specifications are formally proved and software is extracted from this proof.
Aled Walters