Dr.-Ing. Daniel Hausmann



Organisation


Lehrstuhl für Informatik 8 (Theoretische Informatik)


Publications (Download BibTeX)


Hausmann, D., & Schröder, L. (2019). Optimal Satisfiability Checking for Arithmetic µ-Calculi. In Mikolaj Bojanczyk, Alex Simpson (Eds.), Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2019 (pp. 277-294). Springer Verlag.
Hausmann, D., Schröder, L., & Deifel, H.-P. (2018). Permutation games for the weakly aconjunctive μ -calculus. In 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018 (pp. 361-378). Springer.
Hausmann, D., Schröder, L., & Egger, C. (2016). Global Caching for the Alternation-free Coalgebraic mu-calculus. In Proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016 (pp. 34:1-34:15). Québec City, Canada: Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Hausmann, D., Schröder, L., & Egger, C. (2016). Global Caching for the Alternation-free mu-Calculus. In Josée Desharnais, Radha Jagadeesan (Eds.), 27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada (pp. 34:1--34:15). Québec City, CA: Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Schröder, L., & Hausmann, D. (2015). Global Caching for the Flat Coalgebraic mu-Calculus. In Proc. 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015 (pp. 121-130). IEEE.
Hausmann, D., & Schröder, L. (2015). Global Caching for the Flat Coalgebraic μ-Calculus. In Grandi F, Lange M, Lomuscio A (Eds.), Proceedings, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015 (pp. 121-130). Kassel, DE: Berlin: Springer.

Last updated on 2018-07-09 at 23:50