| Publication | Date of Publication | Type |
|---|
On the existential theories of Büchi arithmetic and linear \(p\)-adic fields
| 2024-12-19 | Paper |
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
| 2024-12-19 | Paper |
Geometric decision procedures and the VC dimension of linear arithmetic theories
| 2024-12-06 | Paper |
On polynomial-time decidability of \(k\)-negations fragments of FO theories (extended abstract)
| 2024-12-03 | Paper |
Integer programming with GCD constraints
| 2024-11-28 | Paper |
Reachability in fixed VASS: expressiveness and lower bounds
| 2024-10-30 | Paper |
Higher-order quantified Boolean satisfiability
| 2024-08-06 | Paper |
Quantifier elimination for counting extensions of Presburger arithmetic
Lecture Notes in Computer Science | 2024-01-23 | Paper |
Integer Programming with GCD Constraints
| 2023-08-25 | Paper |
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes
| 2023-08-08 | Paper |
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Journal of the ACM | 2022-12-08 | Paper |
On the expressiveness of Büchi arithmetic
| 2021-10-18 | Paper |
Directed reachability for infinite-state systems
| 2021-10-18 | Paper |
scientific article; zbMATH DE number 7407773 (Why is no real title available?)
| 2021-10-08 | Paper |
Affine extensions of integer vector addition systems with states
| 2021-08-04 | Paper |
Logics for continuous reachability in Petri nets and vector addition systems with states
| 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297838 (Why is no real title available?)
| 2021-01-19 | Paper |
On the Expressiveness of B\"uchi Arithmetic
| 2020-10-24 | Paper |
Approaching arithmetic theories with finite-state automata
| 2020-07-27 | Paper |
On the complexity of quantified integer programming
| 2020-05-27 | Paper |
Counting problems for Parikh images
| 2020-05-26 | Paper |
Approaching the coverability problem continuously
| 2019-09-17 | Paper |
On the Size of Finite Rational Matrix Semigroups
| 2019-09-09 | Paper |
Context-free commutative grammars with integer counters and resets
Theoretical Computer Science | 2018-06-05 | Paper |
Reachability in two-dimensional vector addition systems with states is PSPACE-complete
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Subclasses of Presburger arithmetic and the weak EXP hierarchy
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Tightening the complexity of equivalence problems for commutative grammars
| 2018-01-24 | Paper |
The taming of the semi-linear set
| 2017-12-19 | Paper |
A polynomial-time algorithm for reachability in branching VASS in dimension one
| 2017-12-19 | Paper |
The logical view on continuous Petri nets
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Relating reachability problems in timed and counter automata
Fundamenta Informaticae | 2017-03-16 | Paper |
The complexity of the \(K\)th largest subset problem and related problems
Information Processing Letters | 2015-12-01 | Paper |
The odds of staying on budget
Automata, Languages, and Programming | 2015-11-04 | Paper |
Integer vector addition systems with states
Lecture Notes in Computer Science | 2015-10-28 | Paper |
The power of priority channel systems
Logical Methods in Computer Science | 2015-01-15 | Paper |
Foundations for decision problems in separation logic with general inductive predicates
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Reachability in register machines with polynomial updates
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The Power of Priority Channel Systems
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
On the relationship between reachability problems in timed and counter automata
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Branching-time model checking of parametric one-counter automata
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Tractable Reasoning in a Fragment of Separation Logic
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
On Process-Algebraic Extensions of Metric Temporal Logic
Reflections on the Work of C.A.R. Hoare | 2010-10-26 | Paper |
Model checking succinct and parametric one-counter automata
Automata, Languages and Programming | 2010-09-07 | Paper |
Ideal downward refinement in the \(\mathcal{EL}\) description logic
Inductive Logic Programming | 2010-08-24 | Paper |
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
An efficient quantifier elimination procedure for Presburger arithmetic
| N/A | Paper |
