Dr. Daniel Hausmann

About me

From May 2021 on I am working in the formal methods group in Gothenburg.

Previously I have been postdoctoral researcher at the Chair for Theoretical Computer Science of the Friedrich-Alexander University of Erlangen and Nuremberg.

I am interested in e.g.

  • general fixpoint theory
  • automata on infinite words
  • solving two-player games
  • the algorithmics of temporal logics (e.g. model and satisfiability checking for branching-time and linear-time logics)
  • coalgebra and coalgebraic logic

My PhD-thesis Satisfiability Checking for the Coalgebraic µ-Calculus (supervised by Lutz Schröder) gives a detailed discourse on decision procedures for the satisfiability problem of general modal fixpoint logics.

We have implemented various satisfiability and model checking algorithms for the coalgebraic µ-calculus within COOL.

Address:   FAU Erlangen-Nürnberg Room:   11.157
    Chair for Theoretical Computer Science Telephone:   +49-9131-85-64030
    Martensstraße 3 Fax:   +49-9131-85-64055
    D-91058 Erlangen E-Mail:   daniel.hausmann(at)


Also see my profiles at DBLP, Google Scholar or ResearchGate.

Recent and Upcoming Talks

In my time as a PhD student, I have given lectures on Modal Logic (2016, 2017), and organized and held tutorials for courses on Complexity of Algorithms (2013), Theory of Programming (2014, 2015, 2016) and Logic for Computer Scientists (2015, 2016, 2017).