| 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
Theoretical Computer Science | 2024-08-20 | Paper |
| Backward symbolic execution with loop folding | 2022-06-17 | Paper |
Fast computation of strong control dependencies
(available as arXiv preprint) | 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 |
| Almost linear Büchi automata | 2021-01-26 | Paper |
LTL to self-loop alternating automata with generic acceptance and back
Theoretical Computer Science | 2020-09-17 | Paper |
Generic emptiness check for fun and profit
Automated Technology for Verification and Analysis | 2020-07-20 | Paper |
LTL to smaller self-loop alternating automata and back
(available as arXiv preprint) | 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
Information Processing Letters | 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
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Symbolic memory with pointers
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Compact symbolic execution
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Comparison of LTL to Deterministic Rabin Automata Translators
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
On symbolic verification of weakly extended PAD
Electronic Notes in Theoretical Computer Science | 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
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
LTL to Büchi automata translation: fast and more deterministic
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Almost linear Büchi automata
MSCS. Mathematical Structures in Computer Science | 2012-05-11 | Paper |
Reachability is decidable for weakly extended process rewrite systems
Information and Computation | 2009-06-11 | Paper |
On decidability of LTL model checking for process rewrite systems
Acta Informatica | 2009-03-26 | Paper |
On Decidability of LTL Model Checking for Process Rewrite Systems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Petri nets are less expressive than state-extended PA
Theoretical Computer Science | 2008-04-15 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
CONCUR 2004 - Concurrency Theory
Lecture Notes in Computer Science | 2005-08-23 | Paper |
The stuttering principle revisited
Acta Informatica | 2005-08-02 | Paper |
| scientific article; zbMATH DE number 1948168 (Why is no real title available?) | 2003-07-10 | Paper |
