Daniel Hausmann

Affiliations:
  • University of Erlangen-Nuremberg, Theoretical Computer Science, Germany (PhD 2018)


According to our database1, Daniel Hausmann authored at least 22 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Quasipolynomial Computation of Nested Fixpoints.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

A Linear-Time Nominal μ-Calculus with Name Allocation.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Nominal Büchi Automata with Name Allocation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Harnessing LTL With Freeze Quantification.
CoRR, 2020

Cheap CTL Compassion in NuSMV.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

NP Reasoning in the Monotone μ-Calculus.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Computing Nested Fixpoints in Quasipolynomial Time.
CoRR, 2019

Optimal Satisfiability Checking for Arithmetic μ-Calculi.
CoRR, 2019

Optimal Satisfiability Checking for Arithmetic \mu -Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Game-Based Local Model Checking for the Coalgebraic mu-Calculus.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Satisfiability Checking for the Coalgebraic µ-Calculus.
PhD thesis, 2018

Permutation Games for the Weakly Aconjunctive \mu μ -Calculus.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

2017
Permutation Games for the Weakly Aconjunctive mu-Calculus.
CoRR, 2017

2016
Global Caching for the Alternation-free μ-Calculus.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Global Caching for the Flat Coalgebraic µ-Calculus.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

2010
Optimizing Conditional Logic Reasoning within CoLoSS.
Electron. Notes Theor. Comput. Sci., 2010

Optimal Tableaux for Conditional Logics with Cautious Monotonicity.
Proceedings of the ECAI 2010, 2010

2009
The Importance of Being Formal.
Electron. Notes Theor. Comput. Sci., 2009

2008
Zertifizierung einer Sicherungskomponente mittels durchgängig formaler Modellierung.
Proceedings of the Software Engineering 2008, 2008

2006
A coalgebraic approach to the semantics of the ambient calculus.
Theor. Comput. Sci., 2006

2005
Iterative Circular Coinduction for CoCasl in Isabelle/HOL.
Proceedings of the Fundamental Approaches to Software Engineering, 2005

Towards a Coalgebraic Semantics of the Ambient Calculus.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005


  Loading...