Dr. Daniel Hausmann
About me
I am interested in e.g.

general fixpoint theory

automata on infinite words

solving twoplayer games

the algorithmics of temporal logics (e.g. model and satisfiability checking for branchingtime and lineartime 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 FriedrichAlexander University of Erlangen and Nuremberg.
Publications

A LinearTime Nominal muCalculus with Name Allocation (Daniel Hausmann, Stefan Milius, Lutz Schröder), In Proc. 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Leibniz International Proceedings in Informatics (LIPIcs), vol. 202, pp. 58:1–58:18, Schloss Dagstuhl – LeibnizZentrum fuer Informatik, 2021. [extended version on arXiv]

Nominal Büchi Automata with Name Allocation (Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder), In Proc. 32th International Conference on Concurrency Theory, CONCUR 2021, Leibniz International Proceedings in Informatics (LIPIcs), vol. 203, pp. 4:1–4:16, Schloss Dagstuhl – LeibnizZentrum fuer Informatik, 2021, to appear. [extended version on arXiv]

Quasipolynomial Computation of Nested Fixpoints (Daniel Hausmann, Lutz Schröder), In Proc. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, Lecture Notes in Computer Science (LNCS), vol. 12651, pp. 38–56, Springer International Publishing, 2021. [extended version on arXiv]

NP Reasoning in the Monotone µCalculus (Daniel Hausmann, Lutz Schröder), In Proc. 10th International Joint Conference on Automated Reasoning, IJCAR 2020, Lecture Notes in Artificial Intelligence (LNAI), vol. 12166, pp. 482–499, Springer International Publishing, 2020. [extended version on arXiv]

Cheap CTL Compassion in NuSMV (Daniel Hausmann, Tadeusz Litak, Christoph Rauch, Matthias Zinner), In Proc. 21st International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2020, Lecture Notes in Computer Science (LNCS), vol. 11990, pp. 248–269, Springer International Publishing, 2020. [artifact]

GameBased Local Model Checking for the Coalgebraic µCalculus (Daniel Hausmann, Lutz Schröder), In Proc. 30th International Conference on Concurrency Theory, CONCUR 2019, Leibniz International Proceedings in Informatics (LIPIcs), vol. 140, pp. 35:1–35:16, Schloss Dagstuhl – LeibnizZentrum fuer Informatik, 2019. [pdf]

Optimal Satisfiability Checking for Arithmetic µCalculi (Daniel Hausmann, Lutz Schröder), In Proc. 22nd International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2019, Lecture Notes in Computer Science (LNCS), vol. 11425, pp. 277–294, Springer International Publishing, 2019. [extended version on arXiv]

Satisfiability Checking for the Coalgebraic µCalculus (Daniel Hausmann), FriedrichAlexanderUniversität ErlangenNürnberg (FAU), 2018. (PhD Thesis) [pdf]

Permutation Games for the Weakly Aconjunctive µCalculus (Daniel Hausmann, Lutz Schröder, HansPeter Deifel), In Proc. 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018, Lecture Notes in Computer Science (LNCS), vol. 10805–10806, pp. 361–378, Springer International Publishing, 2018. [extended version on arXiv] [artifact]

Global Caching for the Alternationfree µCalculus (Daniel Hausmann, Lutz Schröder, Christoph Egger), In Proc. 27th International Conference on Concurrency Theory, CONCUR 2016, Leibniz International Proceedings in Informatics (LIPIcs), vol. 59, pp. 34:1–34:15, Schloss Dagstuhl – LeibnizZentrum fuer Informatik, 2016. [pdf]

Global Caching for the Flat Coalgebraic µCalculus (Daniel Hausmann, Lutz Schröder), In Proc. 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, pp. 121–130, IEEE Comp. Soc., 2015.

Optimal Tableaux for Conditional Logics with Cautious Monotonicity (Lutz Schröder, Dirk Pattinson, Daniel Hausmann), In Proc. 6th European Conference on Artificial Intelligence, ECAI 2010, Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 707–712, IOS Press, 2010. [preprint]

Optimizing Conditional Logic Reasoning within CoLoSS (Daniel Hausmann, Lutz Schröder), In Proc. 6th Workshop on Methods for Modalities, M4M6 2009, Electronic Notes in Theoretical Computer Science (ENTCS), vol. 262, pp. 157–171, Elsevier Science; Amsterdam, 2010. [preprint]

The Importance of Being Formal (Udo Frese, Daniel Hausmann, Christoph Lüth, Holger Täubig, Dennis Walter), In Proc. Workshop on Certification of SafetyCritical Software Controlled Systems, SafeCert08, Electronic Notes in Theoretical Computer Science (ENTCS), vol. 238 (4), pp. 57–70, Elsevier Science; Amsterdam, 2009. [pdf]

A Coalgebraic Approach to the Semantics of the Ambient Calculus (Daniel Hausmann, Till Mossakowski, Lutz Schröder), In Theoretical Computer Science, vol. 366, pp. 121–143, Elsevier, 2006. (extends Hausmann et al. 2005)

Towards a Coalgebraic Semantics of the Ambient Calculus (Daniel Hausmann, Till Mossakowski, Lutz Schröder), In Proc. 1st International Conference on Algebra and Coalgebra in Computer Science, CALCO 2005, Lecture Notes in Computer Science (LNCS), vol. 3629, pp. 232–246, Springer International Publishing, 2005.

Iterative Circular Coinduction for CoCasl in Isabelle/HOL (Daniel Hausmann, Till Mossakowski, Lutz Schröder), In Proc. 8th International Conference on Fundamental Approaches to Software Engineering, FASE 2005, Lecture Notes in Computer Science (LNCS), vol. 3442, pp. 341–356, Springer International Publishing, 2005.
Also see my profiles at DBLP, Google Scholar or ResearchGate.
Recent and Upcoming Talks

Uniform Solving for omegaRegular Games presented at Highlights 2021, (Aachen), 15 September 2021 (poster)

A LinearTime Nominal muCalculus with Name Allocation presented at MFCS 2021, (Tallinn), 24 August 2021 (video)

A LinearTime Nominal muCalculus with Name Allocation at the Seminar of the Formal Methods Group Gothenburg, (Gothenburg), 17 August 2021

Quasipolynomial Computation of Nested Fixpoints presented at TACAS 2021, (Luxembourg), 29 March 2021 (video)

Quasipolynomial Computation of Nested Fixpoints at the Seminar of the Formal Methods Group Gothenburg, (Gothenburg), 25 February 2021

NP Reasoning in the Monotone µCalculus presented at Highlights 2020, (Aachen), 16 September 2020 (video, poster)

Harnessing LTL With Freeze Quantification at the Chair Seminar, (Erlangen), 4 August 2020

Cheap CTL Compassion in NuSMV presented at VMCAI 2020, New Orleans, 20 January 2020

Satisfiability Checking for the Coalgebraic µCalculus, honouring at Tag der Technischen Fakultät, Erlangen, 22 November 2019 (poster)

Quasipolynomial Computation of Nested Fixpoints at the Chair Seminar, Erlangen, 29 October 2019

Computing Nested Fixpoints in Quasipolynomial Time at LaBRI Formal Methods Seminar, Bordeaux, 22 October 2019

GameBased Local Model Checking for the Coalgebraic μCalculus presented at CONCUR 2019, Amsterdam, 30 August 2019

Optimal Satisfiability Checking for Arithmetic μCalculi presented at FoSSaCS 2019, Prague, 10 April 2019

Optimal Satisfiability Checking for the Coalgebraic μCalculus at the Chair Seminar, Erlangen, 4 December 2018

Permutation Games for the Weakly Aconjunctive µCalculus presented at Highlights 2018, Berlin, 19 September 2018

Satisfiability Checking for the Coalgebraic µCalculus, PhD Defense Talk, University Erlangen, 28 June 2018

Permutation Games for the Weakly Aconjunctive µCalculus presented at TACAS 2018, Thessaloniki, 19 April 2018 (poster)
Further Information
My PhDthesis 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:    
D91058 Erlangen  EMail:  hausmann(at)chalmers.se 