| Publication | Date of Publication | Type |
|---|
| Reducing acceptance marks in Emerson-Lei automata by QBF solving | 2024-11-26 | Paper |
| Tighter construction of tight Büchi automata | 2024-10-30 | Paper |
| Truncating abstraction of bit-vector operations for BDD-based SMT solvers | 2024-08-20 | Paper |
| Backward symbolic execution with loop folding | 2022-06-17 | Paper |
| Fast computation of strong control dependencies | 2022-03-25 | Paper |
| DQBDD: an efficient BDD-based DQBF solver | 2022-03-22 | Paper |
| Speeding up quantified bit-vector SMT solvers by bit-width reductions and extensions | 2021-04-07 | Paper |
| Seminator 2 can complement generalized Büchi automata via improved semi-determinization | 2021-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146593 | 2021-01-26 | Paper |
| LTL to self-loop alternating automata with generic acceptance and back | 2020-09-17 | Paper |
| Generic Emptiness Check for Fun and Profit | 2020-07-20 | Paper |
| LTL to smaller self-loop alternating automata and back | 2019-12-12 | Paper |
| Complementing semi-deterministic Büchi automata | 2019-09-17 | Paper |
| Abstraction of bit-vector operations for BDD-based SMT solvers | 2018-11-23 | Paper |
| On the complexity of the quantified bit-vector arithmetic with binary encoding | 2018-04-05 | Paper |
| On simplification of formulas with unconstrained variables and quantifiers | 2017-11-15 | Paper |
| Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams | 2016-09-05 | Paper |
| Symbolic Memory with Pointers | 2015-12-17 | Paper |
| On Decidability of LTL+Past Model Checking for Process Rewrite Systems | 2015-03-19 | Paper |
| Compact Symbolic Execution | 2014-07-08 | Paper |
| Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment | 2014-07-08 | Paper |
| Comparison of LTL to Deterministic Rabin Automata Translators | 2014-01-17 | Paper |
| On symbolic verification of weakly extended PAD | 2013-12-13 | Paper |
| Refining the undecidability border of weak bisimilarity | 2013-10-07 | Paper |
| On extensions of process rewrite systems: rewrite systems with weak finite-state unit | 2013-09-09 | Paper |
| Rewrite Systems with Constraints | 2013-04-26 | Paper |
| LTL to Büchi Automata Translation: Fast and More Deterministic | 2012-06-29 | Paper |
| Almost linear Büchi automata | 2012-05-11 | Paper |
| Reachability is decidable for weakly extended process rewrite systems | 2009-06-11 | Paper |
| On decidability of LTL model checking for process rewrite systems | 2009-03-26 | Paper |
| On Decidability of LTL Model Checking for Process Rewrite Systems | 2008-04-17 | Paper |
| Petri nets are less expressive than state-extended PA | 2008-04-15 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| CONCUR 2004 - Concurrency Theory | 2005-08-23 | Paper |
| The stuttering principle revisited | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411829 | 2003-07-10 | Paper |
