Dr. Daniel Hausmann

About me

I am interested in e.g.

  • general fixpoint theory
  • solving two-player games
  • automata on infinite words
  • 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 have been 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.

Upcoming Publications

  • Faster and Smaller Solutions of Obliging Games (Daniel Hausmann, Nir Piterman), In Proc. 35th International Conference on Concurrency Theory, CONCUR 2024, Leibniz International Proceedings in Informatics (LIPIcs), vol. 311, pp. 30:1–30:25, Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, to appear 2024.
  • Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology (Daniel Hausmann, Mathieu Lehaut, Nir Piterman), In Proc. 22nd International Symposium on Automated Technology for Verification and Analysis, ATVA 2024, Lecture Notes in Computer Science (LNCS), Springer International Publishing, to appear 2024.
  • Faster Game Solving by Fixpoint Acceleration (Daniel Hausmann), In Proc. 12th International Workshop on Fixed Points in Computer Science, FICS 2024, Electronic Proceedings in Theoretical Computer Science (EPTCS), Open Publishing Association, to appear 2024. [pre-proceedings]


Also see my profiles at DBLP or Google Scholar.

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


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ägen 6 Fax:   --
    SE-41296, Gothenburg, Sweden E-Mail:   hausmann(at)chalmers.se