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.

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI

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

PDF DOI