Alessio Mansutti

Amaury Pouly

Log. Methods Comput. Sci., 2026

An optimal pastification algorithm for LTL[X,F] and LTL[X,G].

[BibT_eX]

[DOI]

Artif. Intell., 2026

Optimization Modulo Integer Linear-Exponential Programs.

[BibT_eX]

[DOI]

S. Hitarth

Guruprerana Shabadi

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number.

[BibT_eX]

[DOI]

Jorge Gallego-Hernández

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

One-Parametric Presburger Arithmetic Has Quantifier Elimination.

[BibT_eX]

[DOI]

Mikhail R. Starchak

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

How Big is the Automaton? Certified Lower Bounds on the Size of Presburger DFAs.

[BibT_eX]

[DOI]

Nicolas Amat

Pierre Ganty

Proceedings of the 40th IEEE/ACM International Conference on Automated Software Engineering, 2025

2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version).

[BibT_eX]

[DOI]

Luca Geatti

Angelo Montanari

CoRR, 2024

Integer Programming with GCD Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Integer Linear-Exponential Programming in NP by Quantifier Elimination.

[BibT_eX]

[DOI]

Mikhail R. Starchak

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems.

[BibT_eX]

[DOI]

Luca Geatti

Angelo Montanari

Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023

On Composing Finite Forests with Modal Logics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., April, 2023

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).

[BibT_eX]

[DOI]

Amaury Pouly

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

The Complexity of Presburger Arithmetic with Power or Powers.

[BibT_eX]

[DOI]

Michael Benedikt

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Higher-Order Quantified Boolean Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Geometric decision procedures and the VC dimension of linear arithmetic theories.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy.

[BibT_eX]

[DOI]

Raul Fervari

Proceedings of the Foundations of Software Science and Computation Structures, 2022

Quantifier elimination for counting extensions of Presburger arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

Internal proof calculi for modal logics with separating conjunction.

[BibT_eX]

[DOI]

Raul Fervari

J. Log. Comput., 2021

A Complete Axiomatisation for Quantifier-Free Separation Logic.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Notes on kAExp(pol) problems for deterministic machines.

[BibT_eX]

[DOI]

CoRR, 2021

Presburger arithmetic with threshold counting quantifiers is easy.

[BibT_eX]

[DOI]

CoRR, 2021

On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Logiques de séparation : complexité, expressivité, calculs. (Reasoning with separation logics : complexity, expressive power, proof systems).

[BibT_eX]

[DOI]

PhD thesis, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material).

[BibT_eX]

[DOI]

CoRR, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity.

[BibT_eX]

[DOI]

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

A Framework for Reasoning about Dynamic Axioms in Description Logics.

[BibT_eX]

[DOI]

Bartosz Bednarczyk

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2020

Internal Calculi for Separation Logics.

[BibT_eX]

[DOI]

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Axiomatising Logics with Separating Conjunction and Modalities.

[BibT_eX]

[DOI]

Raul Fervari

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

2018

Deciding Hedged Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Extending Propositional Separation Logic for Robustness Properties.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

The Effects of Adding Reachability Predicates in Propositional Separation Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017

Loose Graph Simulations.

[BibT_eX]

[DOI]

Marco Peressotti

Proceedings of the Software Technologies: Applications and Foundations, 2017

2014

Distributed execution of bigraphical reactive systems.

[BibT_eX]

[DOI]

Marco Peressotti

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems.

[BibT_eX]

[DOI]