# Publications

Whenever applicable, the PDF offered here is the long version of the respective paper. You may also wish to consult my DBLP entry and my Google scholar profile.

(2021). On the Expressiveness of Büchi Arithmetic. Foundations of Software Science and Computation Structures, FOSSACS.

(2021). Directed Reachability for Infinite-State Systems. Tools and Algorithms for the Construction and Analysis of Systems, TACAS.

(2020). On the Size of Finite Rational Matrix Semigroups. Automata, Languages, and Programming, ICALP.

(2020). On the power of ordering in linear arithmetic theories. Automata, Languages, and Programming, ICALP.

(2020). Approaching Arithmetic Theories with Finite-State Automata. Language and Automata Theory and Applications, LATA.

(2017). The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log..

(2017). On the Complexity of Quantified Integer Programming. Automata, Languages, and Programming, ICALP.

(2017). Counting Problems for Parikh Images. Mathematical Foundations of Computer Science, MFCS.

(2017). Computing quantiles in Markov chains with multi-dimensional costs. Logic in Computer Science, LICS.

(2016). Tightening the Complexity of Equivalence Problems for Commutative Grammars. Symposium on Theoretical Aspects of Computer Science, STACS.

(2016). The Taming of the Semi-Linear Set. Automata, Languages, and Programming, ICALP.

(2016). Approaching the Coverability Problem Continuously. Tools and Algorithms for the Construction and Analysis of Systems, TACAS.

(2016). A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. Automata, Languages, and Programming, ICALP.

(2015). The Odds of Staying on Budget. Automata, Languages, and Programming, ICALP.

(2014). The Power of Priority Channel Systems. Log. Methods Comput. Sci..

(2014). Subclasses of Presburger arithmetic and the weak EXP hierarchy. Computer Science Logic and Logic in Computer Science, CSL-LICS.

(2014). Integer Vector Addition Systems with States. Reachability Problems, RP.

(2014). Foundations for Decision Problems in Separation Logic with General Inductive Predicates. Foundations of Software Science and Computation Structures, FOSSACS.

(2013). The Power of Priority Channel Systems. Concurrency Theory, CONCUR.

(2013). SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. Computer Aided Verification, CAV.

(2013). Reachability in Register Machines with Polynomial Updates. Mathematical Foundations of Computer Science, MFCS.

(2012). Branching-Time Model Checking of Parametric One-Counter Automata. Foundations of Software Science and Computational Structures, FOSSACS.

(2011). Tractable Reasoning in a Fragment of Separation Logic. Concurrency Theory, CONCUR.

(2010). On Process-Algebraic Extensions of Metric Temporal Logic. Reflections on the Work of C. A. R. Hoare..

(2010). Model Checking Succinct and Parametric One-Counter Automata. Automata, Languages and Programming, ICALP.

(2009). Ideal Downward Refinement in the $mathcalEL$ Description Logic. Inductive Logic Programming, ILP.