default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Hausmann 0001
Person information
- affiliation: Gothenburg University, Göteborg, Sweden
- affiliation (PhD 2018): University of Erlangen-Nuremberg, Theoretical Computer Science, Germany
Other persons with the same name
- Danny Hausmann 0002 (aka: Daniel Hausmann 0002) — Carnegie Mellon University, Entertainment Technology Center, Pittsburgh, PA, USA
- Daniel Hausmann 0003 — Medical Faculty Mannheim, Heidelberg University, Germany
- Daniel Hausmann 0004 — Department of Psychology, University of Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Daniel Hausmann
, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi. Log. Methods Comput. Sci. 20(3) (2024)- [c22]Daniel Hausmann, Nir Piterman:
Faster and Smaller Solutions of Obliging Games. CONCUR 2024: 28:1-28:19 - [c21]Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair ømega-Regular Games. FoSSaCS (1) 2024: 13-33 - [c20]Daniel Hausmann, Mathieu Lehaut, Nir Piterman:
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis. FoSSaCS (1) 2024: 55-78 - [c19]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. VMCAI (1) 2024: 171-185 - [i17]Daniel Hausmann:
Faster Game Solving by Fixpoint Acceleration. CoRR abs/2404.13687 (2024) - [i16]Daniel Hausmann, Nir Piterman:
Faster and Smaller Solutions of Obliging Games. CoRR abs/2407.11856 (2024) - [i15]Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat:
Alternating Nominal Automata with Name Allocation. CoRR abs/2408.03658 (2024) - [i14]Daniel Hausmann, Mathieu Lehaut, Nir Piterman:
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology. CoRR abs/2408.10708 (2024) - 2023
- [j2]Daniel Hausmann, Prabhat Kumar Jha, Nir Piterman:
Games for Efficient Supervisor Synthesis. IEEE Control. Syst. Lett. 7: 2881-2885 (2023) - [c18]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description). CADE 2023: 234-247 - [d8]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.3. Version 1. Zenodo, 2023 [all versions]
- [d7]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.3. Version 2. Zenodo, 2023 [all versions] - [d6]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmarking scripts for COOL 2.4. Version 3. Zenodo, 2023 [all versions] - [d5]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Benchmarking for COOL Model Checking. Version 1. Zenodo, 2023 [all versions] - [d4]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Benchmarking for COOL Model Checking. Version 2. Zenodo, 2023 [all versions] - [d3]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Benchmarking for COOL Model Checking. Version 3. Zenodo, 2023 [all versions] - [d2]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Benchmarking for COOL Model Checking. Version 4. Zenodo, 2023 [all versions] - [i13]Daniel Hausmann, Mathieu Lehaut, Nir Piterman:
Symbolic Reactive Synthesis for the Safety and EL-fragment of LTL. CoRR abs/2305.02793 (2023) - [i12]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics. CoRR abs/2305.11015 (2023) - [i11]Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair $ω$-Regular Games. CoRR abs/2310.13612 (2023) - [i10]Daniel Hausmann, Merlin Humml, Simon Prucker, Lutz Schröder, Aaron Strahlberger:
Generic Model Checking for Modal Fixpoint Logics in COOL-MC. CoRR abs/2311.01315 (2023) - 2022
- [c17]Daniel Hausmann, Nir Piterman:
A Survey on Satisfiability Checking for the μ-Calculus Through Tree Automata. Principles of Systems Design 2022: 228-251 - [d1]Oliver Görlitz, Daniel Hausmann, Merlin Humml, Dirk Pattinson, Simon Prucker, Lutz Schröder:
Benchmark data for COOL 2.2. Zenodo, 2022 - [i9]Daniel Hausmann, Nir Piterman:
A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata. CoRR abs/2207.00517 (2022) - [i8]Daniel Hausmann, Lutz Schröder:
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/2212.11055 (2022) - 2021
- [c16]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CONCUR 2021: 4:1-4:16 - [c15]Daniel Hausmann, Stefan Milius, Lutz Schröder:
A Linear-Time Nominal μ-Calculus with Name Allocation. MFCS 2021: 58:1-58:18 - [c14]Daniel Hausmann, Lutz Schröder:
Quasipolynomial Computation of Nested Fixpoints. TACAS (1) 2021: 38-56 - [i7]Henning Urbat, Daniel Hausmann, Stefan Milius, Lutz Schröder:
Nominal Büchi Automata with Name Allocation. CoRR abs/2107.03213 (2021) - 2020
- [c13]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone μ-Calculus. IJCAR (1) 2020: 482-499 - [c12]Daniel Hausmann, Tadeusz Litak, Christoph Rauch, Matthias Zinner:
Cheap CTL Compassion in NuSMV. VMCAI 2020: 248-269 - [i6]Daniel Hausmann, Lutz Schröder:
NP Reasoning in the Monotone $μ$-Calculus. CoRR abs/2002.05075 (2020) - [i5]Daniel Hausmann, Stefan Milius, Lutz Schröder:
Harnessing LTL With Freeze Quantification. CoRR abs/2010.10912 (2020)
2010 – 2019
- 2019
- [c11]Daniel Hausmann, Lutz Schröder:
Game-Based Local Model Checking for the Coalgebraic mu-Calculus. CONCUR 2019: 35:1-35:16 - [c10]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic \mu -Calculi. FoSSaCS 2019: 277-294 - [i4]Daniel Hausmann, Lutz Schröder:
Optimal Satisfiability Checking for Arithmetic μ-Calculi. CoRR abs/1901.04893 (2019) - [i3]Daniel Hausmann, Lutz Schröder:
Computing Nested Fixpoints in Quasipolynomial Time. CoRR abs/1907.07020 (2019) - 2018
- [b1]Daniel Hausmann:
Satisfiability Checking for the Coalgebraic µ-Calculus. University of Erlangen-Nuremberg, Germany, 2018 - [c9]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive \mu μ -Calculus. TACAS (2) 2018: 361-378 - 2017
- [i2]Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel:
Permutation Games for the Weakly Aconjunctive mu-Calculus. CoRR abs/1710.08996 (2017) - 2016
- [c8]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CONCUR 2016: 34:1-34:15 - [i1]Daniel Hausmann, Lutz Schröder, Christoph Egger:
Global Caching for the Alternation-free μ-Calculus. CoRR abs/1609.06379 (2016) - 2015
- [c7]Daniel Hausmann, Lutz Schröder:
Global Caching for the Flat Coalgebraic µ-Calculus. TIME 2015: 121-130 - 2010
- [c6]Lutz Schröder, Dirk Pattinson, Daniel Hausmann:
Optimal Tableaux for Conditional Logics with Cautious Monotonicity. ECAI 2010: 707-712
2000 – 2009
- 2009
- [c5]Daniel Hausmann, Lutz Schröder:
Optimizing Conditional Logic Reasoning within CoLoSS. M4M 2009: 157-171 - 2008
- [c4]Udo Frese, Daniel Hausmann, Christoph Lüth, Holger Täubig, Dennis Walter:
Zertifizierung einer Sicherungskomponente mittels durchgängig formaler Modellierung. Software Engineering (Workshops) 2008: 335-338 - [c3]Udo Frese, Daniel Hausmann, Christoph Lüth, Holger Täubig, Dennis Walter:
The Importance of Being Formal. SafeCert@ETAPS 2008: 57-70 - 2006
- [j1]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
A coalgebraic approach to the semantics of the ambient calculus. Theor. Comput. Sci. 366(1-2): 121-143 (2006) - 2005
- [c2]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
Towards a Coalgebraic Semantics of the Ambient Calculus. CALCO 2005: 232-246 - [c1]Daniel Hausmann, Till Mossakowski, Lutz Schröder:
Iterative Circular Coinduction for CoCasl in Isabelle/HOL. FASE 2005: 341-356
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
