1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2023★ 1 cited
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
Daniel Hausmann, Merlin Humml, Simon Prucker +2
We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the nex…
cs.LO2022
A Survey on Satisfiability Checking for the -Calculus through Tree Automata
Daniel Hausmann, Nir Piterman
Algorithms for model checking and satisfiability of the modal -calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to chec…
cs.LO2016
Global Caching for the Alternation-free -Calculus
Daniel Hausmann, Lutz Schröder, Christoph Egger
We present a sound, complete, and optimal single-pass tableau algorithm for the alternation-free -calculus. The algorithm supports global caching with intermediate propagation a…