| Multi-agent systems design and prototyping with bigraphical reactive systems A Mansutti, M Miculan, M Peressotti DAIS'14, 201-208, 2014 | 42 | 2014 |
| The Effects of Adding Reachability Predicates in Propositional Separation Logic S Demri, É Lozes, A Mansutti FOSSACS'18, 476-493, 2018 | 32 | 2018 |
| The complexity of Presburger arithmetic with power or powers M Benedikt, D Chistikov, A Mansutti ICALP'23, 112:1-112:18, 2023 | 16 | 2023 |
| Distributed execution of bigraphical reactive systems A Mansutti, M Miculan, M Peressotti ECEASST 71, 2015 | 15 | 2015 |
| Axiomatising logics with separating conjunction and modalities S Demri, R Fervari, A Mansutti JELIA'19, 692-708, 2019 | 13 | 2019 |
| Towards distributed bigraphical reactive systems A Mansutti, M Miculan, M Peressotti GCM'14, 45-59, 2014 | 12 | 2014 |
| Extending propositional separation logic for robustness properties A Mansutti FSTTCS'18, 2018 | 11 | 2018 |
| Integer Linear-Exponential Programming in NP by Quantifier Elimination D Chistikov, A Mansutti, MR Starchak ICALP'24, 2024 | 8 | 2024 |
| Modal logics with composition on finite forests: Expressivity and complexity B Bednarczyk, S Demri, R Fervari, A Mansutti LICS'20, 167-180, 2020 | 8* | 2020 |
| Higher-order quantified boolean satisfiability D Chistikov, C Haase, Z Hadizadeh, A Mansutti MFCS'22, 2022 | 7 | 2022 |
| Geometric decision procedures and the VC dimension of linear arithmetic theories D Chistikov, C Haase, A Mansutti LICS'22, 2022 | 7 | 2022 |
| A complete axiomatisation for quantifier-free separation logic S Demri, É Lozes, A Mansutti Logical Methods in Computer Science 17, 2021 | 7 | 2021 |
| Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems A Mansutti École Normale Supérieure Paris-Saclay, France, 2020 | 7 | 2020 |
| Internal calculi for separation logics S Demri, E Lozes, A Mansutti CSL'20, 2019 | 7 | 2019 |
| An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning. A Mansutti FOSSACS'20, 462-481, 2020 | 6 | 2020 |
| Quantifier elimination for counting extensions of Presburger arithmetic D Chistikov, C Haase, A Mansutti FOSSACS'22, 225-243, 2022 | 5 | 2022 |
| Integer Programming with GCD Constraints R Défossez, C Haase, A Mansutti, GA Pérez SODA'24, 3605-3658, 2024 | 3 | 2024 |
| On deciding linear arithmetic constraints over p-adic integers for all primes C Haase, A Mansutti MFCS'21, 2021 | 3 | 2021 |
| The effects of adding reachability predicates in quantifier-free separation logic S Demri, É Lozes, A Mansutti ACM Transactions on Computational Logic (TOCL) 22 (2), 1-56, 2021 | 3 | 2021 |
| Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems L Geatti, A Mansutti, A Montanari FOSSACS'24, 95-115, 2024 | 2 | 2024 |
Stéphane DemriCNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles (LMF)Verified email at lmf.cnrs.fr
