Dr. Daniel Hausmann

About me

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

Since May 2021, I am working as a postdoctoral researcher with Nir Piterman in the formal methods group at the University Gothenburg and at Chalmers Technical University. Previously I have been postdoctoral researcher with Lutz Schröder and Stefan Milius at the Chair for Theoretical Computer Science of the Friedrich-Alexander University of Erlangen and Nuremberg.

Publications

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

Recent and Upcoming Talks

Further Information

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.

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

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

Contact

Address:   Gothenburg University and Chalmers University of Technology Room:   ED 6455 (EDIT Building)
    Formal Methods Group, Department of Computer Science and Engineering Telephone:   --
    Rännväg 6 Fax:   --
    D-91058 Erlangen E-Mail:   hausmann(at)chalmers.se