| Multi-agent systems design and prototyping with bigraphical reactive systems A Mansutti, M Miculan, M Peressotti DAIS 2014, LNCS 8460, 201-208, 2014 | 41 | 2014 |
| The Effects of Adding Reachability Predicates in Propositional Separation Logic S Demri, É Lozes, A Mansutti FoSSaCS 2018, LNCS 10803, 476-493, 2018 | 32 | 2018 |
| 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 European Conference on Logics in Artificial Intelligence, 692-708, 2019 | 13 | 2019 |
| Towards distributed bigraphical reactive systems A Mansutti, M Miculan, M Peressotti GCM 2014, 45-59, 2014 | 12 | 2014 |
| Extending propositional separation logic for robustness properties A Mansutti 38th IARCS Annual Conference on Foundations of Software Technology and …, 2018 | 11 | 2018 |
| The complexity of Presburger arithmetic with power or powers M Benedikt, D Chistikov, A Mansutti arXiv preprint arXiv:2305.03037, 2023 | 8 | 2023 |
| Modal logics with composition on finite forests: Expressivity and complexity B Bednarczyk, S Demri, R Fervari, A Mansutti Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 8* | 2020 |
| Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems A Mansutti École Normale Supérieure, France, 2020 | 7 | 2020 |
| Internal calculi for separation logics S Demri, E Lozes, A Mansutti arXiv preprint arXiv:1910.05016, 2019 | 7 | 2019 |
| Higher-order quantified boolean satisfiability D Chistikov, C Haase, Z Hadizadeh, A Mansutti Leibniz International Proceedings in Informatics 241, 2022 | 6 | 2022 |
| 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 |
| Geometric decision procedures and the VC dimension of linear arithmetic theories D Chistikov, C Haase, A Mansutti | 5 | 2022 |
| A complete axiomatisation for quantifier-free separation logic S Demri, É Lozes, A Mansutti Logical Methods in Computer Science 17, 2021 | 5 | 2021 |
| Quantifier elimination for counting extensions of Presburger arithmetic D Chistikov, C Haase, A Mansutti International Conference on Foundations of Software Science and Computation …, 2022 | 4 | 2022 |
| 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 | 2 | 2021 |
| Presburger arithmetic with threshold counting quantifiers is easy D Chistikov, C Haase, A Mansutti arXiv preprint arXiv:2103.05087, 2021 | 2 | 2021 |
| Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version) L Geatti, A Mansutti, A Montanari arXiv preprint arXiv:2401.09860, 2024 | 1 | 2024 |
| Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy. R Fervari, A Mansutti FoSSaCS, 305-324, 2022 | 1 | 2022 |
| Notes on kAExp (pol) problems for deterministic machines A Mansutti arXiv preprint arXiv:2110.05630, 2021 | 1 | 2021 |
Stéphane DemriCNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles (LMF)Verified email at lmf.cnrs.fr
