Dr. Daniel Hausmann

• 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), vol. 1505, pp.160-180, Springer International Publishing, 2024. [extended version on arXiv]
• 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. 28:1–28:19, Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, 2024. [extended version on arXiv]
• Coalgebraic Satisfiability Checking for Arithmetic µ-Calculi (Daniel Hausmann, Lutz Schröder), In Logical Methods in Computer Science (LMCS), vol. 20, Issue 3, 2024.
• Fair ω-Regular Games (Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck), In Proc. 27th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2024, Lecture Notes in Computer Science (LNCS), vol. 14574, pp. 13–33, Springer International Publishing, 2024. [extended version on arXiv]
• Symbolic Solution of Emerson-Lei Games for Reactive Synthesis (Daniel Hausmann, Mathieu Lehaut, Nir Piterman), In Proc. 27th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2024, Lecture Notes in Computer Science (LNCS), vol. 14574, pp. 55–78, Springer International Publishing, 2024. [extended version on arXiv]
• Generic Model Checking for Modal Fixpoint Logics in COOL-MC (Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger), In Proc. 25th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2024, Lecture Notes in Computer Science (LNCS), vol. 14499, pp. 171–185, Springer International Publishing, 2024. [extended version on arXiv] [artifact]
• Games for Efficient Supervisor Synthesis (Daniel Hausmann, Prabhat Kumar Jha, Nir Piterman), In IEEE Control Systems Letters, vol. 7, pp. 2881–2885, IEEE, 2023.
• COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder), In Proc. 29th international Conference on Automated Deduction, CADE 2023, Lecture Notes in Computer Science (LNCS), vol. 14132, pp. 234–247, Springer International Publishing, 2023. [extended version on arXiv] [artifact]
• A Survey on Satisfiability Checking for the µ-Calculus through Tree Automata (Daniel Hausmann, Nir Piterman), In Principles of Systems Design -- Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, Lecture Notes in Computer Science (LNCS), vol. 13660, pp. 228–251, Springer International Publishing, 2022. [extended version on arXiv]
• A Linear-Time Nominal µ-Calculus 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 – Leibniz-Zentrum 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 – Leibniz-Zentrum fuer Informatik, 2021. [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]
• Game-Based 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 – Leibniz-Zentrum 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), Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2018. (PhD Thesis) [pdf]
• Permutation Games for the Weakly Aconjunctive µ-Calculus (Daniel Hausmann, Lutz Schröder, Hans-Peter 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 Alternation-free µ-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 – Leibniz-Zentrum 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, M4M-6 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 Safety-Critical Software Controlled Systems, SafeCert-08, 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 or Google Scholar.

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

Contact