default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessio Mansutti
Person information
- affiliation: IMDEA Software Institute, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Alessio Mansutti
:
Logiques de séparation : complexité, expressivité, calculs. (Reasoning with separation logics : complexity, expressive power, proof systems). University of Paris-Saclay, France, 2020
Journal Articles
- 2023
- [j6]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
On Composing Finite Forests with Modal Logics. ACM Trans. Comput. Log. 24(2): 12:1-12:46 (2023) - 2022
- [j5]Alessio Mansutti:
An auxiliary logic on trees: On the tower-hardness of logics featuring reachability and submodel reasoning. Inf. Comput. 285(Part): 104911 (2022) - 2021
- [j4]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. Log. Methods Comput. Sci. 17(3) (2021) - [j3]Stéphane Demri, Raul Fervari, Alessio Mansutti:
Internal proof calculi for modal logics with separating conjunction. J. Log. Comput. 31(3): 832-891 (2021) - [j2]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Trans. Comput. Log. 22(2): 14:1-14:56 (2021) - 2014
- [j1]Alessio Mansutti, Marino Miculan, Marco Peressotti:
Distributed execution of bigraphical reactive systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 71 (2014)
Conference and Workshop Papers
- 2024
- [c20]Luca Geatti, Alessio Mansutti, Angelo Montanari:
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems. FoSSaCS (2) 2024: 95-115 - [c19]Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. ICALP 2024: 132:1-132:20 - [c18]Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez:
Integer Programming with GCD Constraints. SODA 2024: 3605-3658 - 2023
- [c17]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The Complexity of Presburger Arithmetic with Power or Powers. ICALP 2023: 112:1-112:18 - [c16]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS 2023: 52:1-52:14 - 2022
- [c15]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Quantifier elimination for counting extensions of Presburger arithmetic. FoSSaCS 2022: 225-243 - [c14]Raul Fervari, Alessio Mansutti:
Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy. FoSSaCS 2022: 305-324 - [c13]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Geometric decision procedures and the VC dimension of linear arithmetic theories. LICS 2022: 59:1-59:13 - [c12]Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti:
Higher-Order Quantified Boolean Satisfiability. MFCS 2022: 33:1-33:15 - 2021
- [c11]Christoph Haase, Alessio Mansutti:
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. MFCS 2021: 55:1-55:20 - 2020
- [c10]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CSL 2020: 19:1-19:18 - [c9]Alessio Mansutti:
An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning. FoSSaCS 2020: 462-481 - [c8]Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti:
A Framework for Reasoning about Dynamic Axioms in Description Logics. IJCAI 2020: 1681-1687 - [c7]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. LICS 2020: 167-180 - 2019
- [c6]Stéphane Demri, Raul Fervari, Alessio Mansutti:
Axiomatising Logics with Separating Conjunction and Modalities. JELIA 2019: 692-708 - 2018
- [c5]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. FoSSaCS 2018: 476-493 - [c4]Alessio Mansutti:
Extending Propositional Separation Logic for Robustness Properties. FSTTCS 2018: 42:1-42:23 - [c3]Alessio Mansutti, Marino Miculan:
Deciding Hedged Bisimilarity. ICTCS 2018: 218-229 - 2017
- [c2]Alessio Mansutti, Marino Miculan, Marco Peressotti:
Loose Graph Simulations. STAF Workshops 2017: 109-126 - 2014
- [c1]Alessio Mansutti, Marino Miculan, Marco Peressotti:
Multi-agent Systems Design and Prototyping with Bigraphical Reactive Systems. DAIS 2014: 201-208
Informal and Other Publications
- 2024
- [i14]Luca Geatti, Alessio Mansutti, Angelo Montanari:
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version). CoRR abs/2401.09860 (2024) - [i13]Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak:
Integer Linear-Exponential Programming in NP by Quantifier Elimination. CoRR abs/2407.07083 (2024) - [i12]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. CoRR abs/2407.18420 (2024) - 2023
- [i11]Michael Benedikt, Dmitry Chistikov, Alessio Mansutti:
The complexity of Presburger arithmetic with power or powers. CoRR abs/2305.03037 (2023) - [i10]Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez:
Integer Programming with GCD Constraints. CoRR abs/2308.13609 (2023) - 2021
- [i9]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Presburger arithmetic with threshold counting quantifiers is easy. CoRR abs/2103.05087 (2021) - [i8]Alessio Mansutti:
Notes on kAExp(pol) problems for deterministic machines. CoRR abs/2110.05630 (2021) - 2020
- [i7]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. CoRR abs/2006.05156 (2020) - [i6]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). CoRR abs/2007.08598 (2020) - 2019
- [i5]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CoRR abs/1910.05016 (2019) - 2018
- [i4]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. CoRR abs/1810.05410 (2018) - 2017
- [i3]Alessio Mansutti, Marino Miculan, Marco Peressotti:
Loose Graph Simulations. CoRR abs/1705.08241 (2017) - 2016
- [i2]Alessio Mansutti, Marino Miculan:
Deciding Hedged Bisimilarity. CoRR abs/1611.03424 (2016) - 2015
- [i1]Alessio Mansutti, Marino Miculan, Marco Peressotti:
Distributed execution of bigraphical reactive systems. CoRR abs/1503.02434 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
