Dr. Daniel Hausmann
Upcoming Publications
-
Büchi Games for the Unguarded Alternation-free µ-Calculus (Daniel Hausmann), In Proc. 15th International Tbilisi Symposium on Logic, Language and Computation, TbiLLC 2025, Lecture Notes in Computer Science (LNCS), Springer International Publishing, to appear 2025.
Publications
-
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis (Daniel Hausmann, Shufang Zhu, Gianmarco Parretti, Christoph Weinhuber, Giuseppe De Giacomo, Nir Piterman), In Proc. 22th International Conference on Principles of Knowledge Representation and Reasoning, KR 2025, pp. 810-820, IJCAI Organization, 2025.
-
Efficient Model Checking for the Alternating-Time µ-Calculus via Effectivity Frames (Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder), In Proc. 31st International Symposium on Model Checking Software, SPIN 2025, Lecture Notes in Computer Science (LNCS), vol. 15945, pp. 106-124, Springer International Publishing, 2025.
-
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), vol. 435, pp. 71-80, Open Publishing Association, 2025.
-
Alternating Nominal Automata with Name Allocation (Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat), In Proc. 40th Symposium on Logic in Computer Science, LICS 2025, pp. 57-70, IEEE Computer Society, 2025.
-
Generalised Reachability Games Revisited (Sougata Bose, Daniel Hausmann, Soumyajit Paul, Sven Schewe, Tansholpan Zhanabekova), In Proc. 16th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2025, Electronic Proceedings in Theoretical Computer Science (EPTCS), vol. 428, pp. 76-90, Open Publishing Association, 2025.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
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.
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.
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.
Satisfiability Checking for the Coalgebraic µ-Calculus (Daniel Hausmann), Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), 2018. (PhD Thesis)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.
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.
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.
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.
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.
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.
Some Talks
-
Faster Game Solving by Fixpoint Acceleration presented at FICS 2024, Naples, 19 February 2024
-
Generic Model Checking for Modal Fixpoint Logics in COOL-MC presented at VMCAI 2024, London, 15 January 2024
-
Games for Fun and Profit presented at retreat of the Formal Methods Group Gothenburg, Henån, 12 December 2023
-
Solving Emerson-Lei Games via Zielonka Trees presented at Highlights 2023, Kassel, 11 Juli 2023 (poster)
-
Emerson-Lei Games presented at Seminar of the Formal Methods Group Gothenburg, Gothenburg, 12 March 2023
-
Game Reductions in Formal Methods presented at retreat of the Formal Methods Group Gothenburg, Särö, 12 January 2023
-
Uniform Solving for omega-Regular Games presented at Highlights 2021, (Aachen), 15 September 2021 (poster)
-
A Linear-Time Nominal µ-Calculus with Name Allocation presented at MFCS 2021, (Tallinn), 24 August 2021 (video)
-
A Linear-Time Nominal µ-Calculus 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
-
Game-Based 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)
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