| Publication | Date of Publication | Type |
|---|
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
Theory and Applications of Satisfiability Testing – SAT 2018 | 2023-04-20 | Paper |
Solving dependency quantified Boolean formulas using quantifier localization
Theoretical Computer Science | 2022-06-24 | Paper |
The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
IEEE Transactions on Automatic Control | 2021-05-28 | Paper |
Long-Run Rewards for Markov Automata
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
A computational perspective of the role of the thalamus in cognition
Neural Computation | 2020-02-07 | Paper |
Skolem functions for DQBF
| 2018-10-25 | Paper |
From DQBF to QBF by dependency elimination
| 2017-11-15 | Paper |
Cost vs. time in stochastic games and Markov automata
Formal Aspects of Computing | 2017-09-08 | Paper |
Cost vs. Time in Stochastic Games and Markov Automata
Dependable Software Engineering: Theories, Tools, and Applications | 2017-08-31 | Paper |
Dependency schemes for DQBF
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Fast debugging of PRISM models
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Preprocessing for DQBF
Lecture Notes in Computer Science | 2015-11-20 | Paper |
High-level counterexamples for probabilistic automata
Logical Methods in Computer Science | 2015-04-22 | Paper |
Counterexample generation for discrete-time Markov models: an introductory survey
Lecture Notes in Computer Science | 2015-02-25 | Paper |
Abstraction-based computation of reward measures for Markov automata
Lecture Notes in Computer Science | 2015-02-04 | Paper |
Minimal counterexamples for linear-time probabilistic verification
Theoretical Computer Science | 2014-08-27 | Paper |
Minimal Critical Subsystems for Discrete-Time Markov Models
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Hierarchical counterexamples for discrete-time Markov chains
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
Lecture Notes in Computer Science | 2009-02-10 | Paper |
The demand for reliability in probabilistic verification
| 2008-10-17 | Paper |
Sigref – A Symbolic Bisimulation Tool Box
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
