| Publication | Date of Publication | Type |
|---|
| One-parametric Presburger arithmetic has quantifier elimination | 2026-08-05 | Paper |
An optimal pastification algorithm for \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{F} \rbrack\) and \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{G} \rbrack \)
Artificial Intelligence | 2026-07-24 | Paper |
| On the existential theory of the reals enriched with integer powers of a computable number | 2026-06-24 | Paper |
On polynomial-time decidability of k-negations fragments of first-order theories
Logical Methods in Computer Science | 2026-03-23 | Paper |
| Integer linear-exponential programming in NP by quantifier elimination | 2026-01-14 | 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 |
| The complexity of Presburger arithmetic with power or powers | 2024-11-14 | Paper |
| Succinctness of cosafety fragments of LTL via combinatorial proof systems | 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 |
Modal logics and local quantifiers: a zoo in the elementary hierarchy
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 |
On Composing Finite Forests with Modal Logics
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
Internal Calculi for Separation Logic
(available as arXiv preprint) | 2023-02-07 | Paper |
| Extending propositional separation logic for robustness properties | 2022-07-21 | Paper |
An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
Information and Computation | 2022-06-08 | Paper |
A complete axiomatisation for quantifier-free separation logic
(available as arXiv preprint) | 2021-10-08 | Paper |
| A complete axiomatisation for quantifier-free separation logic | 2021-10-08 | Paper |
Internal proof calculi for modal logics with separating conjunction
Journal Of Logic And Computation | 2021-09-22 | Paper |
Modal logics with composition on finite forests: expressivity and complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
Lecture Notes in Computer Science | 2020-09-23 | Paper |
| Axiomatising logics with separating conjunction and modalities | 2020-02-18 | Paper |
The effects of adding reachability predicates in propositional separation logic
(available as arXiv preprint) | 2018-07-17 | Paper |
