Dr. Daniel Hausmann
About me
I am interested in
-
infinite-duration games
-
automata on infinite words
-
fixpoint theory
-
reactive synthesis
-
model and satisfiability checking (for temporal logics)
-
coalgebra and coalgebraic logic
Interested in collaboration? I am always open to exciting opportunities for joint work! Information for prospective PhD or postdoctoral students
News
-
July 2025: Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
accepted at KR 2025
-
July 2025: Generalised Reachability Games Revisited
accepted at GandALF 2025
-
May 2025: Büchi Games for the Unguarded Alternation-free µ-Calculus accepted at TbiLLC 2025
-
April 2025: Alternating Nominal Automata with Name Allocation
accepted at LICS 2025
-
March 2025: Efficient Model Checking for the Alternating-Time µ-Calculus via Effectivity Frames
accepted at SPIN 2025
-
February 2025: PC member at CALCO 2025 and KR 2025
-
September 2024: Start of Marie Skłodowska-Curie fellowship at Liverpool, UK
Publications
Also see my profiles at DBLP or Google Scholar.
Short CV
2024 — 2026: Marie Skłodowska-Curie fellow at the University of Liverpool, UK
since 2024: Lecturer (Assistant Professor) in computer science at the University of Liverpool, UK
2021 — 2024: Postdoctoral researcher at the University of Gothenburg / Chalmers University of Technology, Sweden
2018 — 2021: Postdoctoral researcher at Friedrich-Alexander University Erlangen-Nuremberg, Germany
2018: PhD in computer science at Friedrich-Alexander University Erlangen-Nuremberg, Germany
since 2024: Lecturer (Assistant Professor) in computer science at the University of Liverpool, UK
2021 — 2024: Postdoctoral researcher at the University of Gothenburg / Chalmers University of Technology, Sweden
2018 — 2021: Postdoctoral researcher at Friedrich-Alexander University Erlangen-Nuremberg, Germany
2018: PhD in computer science at Friedrich-Alexander University Erlangen-Nuremberg, Germany
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.
Contact
| Address: | University of Liverpool | Room: | Office Room 2.16b, George Holt Building | ||
| School of Computer Science and Informatics | Telephone: | -- | |||
| George Holt Building | Fax: | -- | |||
| Liverpool L69 3BX, United Kingdom | E-Mail: | hausmann(at)liverpool.ac.uk |