Professor Arnold Beckmann
Mathematical logic, logic in computer science, proof theory, blockchain foundations, computational modelling for I4.0.
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
Computability, domain theory, continuous data types, mathematical logic.
Dr. Xiuyi Fan
Research interests include argumentation, multi-agent systems, artificial intelligence
Dr. Phillip James
Cyber security, domain specific languages and verification, formal specification and verification of railway interlocking systems, model checking using SAT-Solving
Dr. Oliver Kullmann
Automated theorem proving, SAT solving, constraint satisfaction, algorithms, complexity theory.
Professor Faron Moller
Concurrency theory, verification problems for infinite state automata, modal and temporal logic, game theory.
Dr. Liam O’Reilly
Algebraic specification, structured modelling, compositional reasoning about reactive systems, tool support for theorem proving and other formal methods.
Dr. Arno Pauly
Computability theory, computable analysis, descriptive set theory, algorithmic game theory.
Professor Markus Roggenbach
Specification languages and their semantics, verification, testing, tools.
Logic and proof theory, interactive theorem proving and program extraction, modelling and verification of railway control systems, formal methods in security and cyberterrorism.
Dr. Anton Setzer
Proof theory and type theory, interactive theorem proving and dependently typed programming, verification of interactive programs and user interfaces, cryptocurrencies and blockchain technology.
Professor John V. Tucker
Theory of data, logical and algebraic methods for modelling and specification, computability theory for topological data types, computability theory for physical systems, monitoring and surveillance studies, history of formal methods, innovation in computing and its impacts
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).
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.