default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Mogavero
Person information
- affiliation: University of Naples Federico II, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Massimo Benerecetti, Daniele Dell'Erba
, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian flair. J. Comput. Syst. Sci. 147: 103580 (2025)- 2024
- [j22]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving mean-payoff games via quasi dominions. Inf. Comput. 297: 105151 (2024) - [c37]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. ICALP 2024: 128:1-128:20 - [c36]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Full Characterisation of Extended CTL. TIME 2024: 18:1-18:18 - [c35]Massimo Benerecetti, Marco Faella, Fabio Mogavero:
Model Checking Linear Temporal Properties on Polyhedral Systems. TIME 2024: 19:1-19:23 - [e3]Andrea Brunello, Alessandro Gianola, Fabio Mogavero:
Short Paper Proceedings of the 5th Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis hosted by the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), Rome, Italy, November 7, 2023. CEUR Workshop Proceedings 3629, CEUR-WS.org 2024 [contents] - [i13]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. CoRR abs/2404.17421 (2024) - 2023
- [j21]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Alternating (In)Dependence-Friendly Logic. Ann. Pure Appl. Log. 174(10): 103315 (2023) - [j20]Massimo Benerecetti, Fabio Mogavero, Adriano Peron:
Taming Strategy Logic: Non-Recurrent Fragments. Inf. Comput. 294: 105081 (2023) - [j19]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Good-for-Game QPTL: An Alternating Hodges Semantics. ACM Trans. Comput. Log. 24(1): 4:1-4:57 (2023) - [c34]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying Over Trees in Monadic Second-Order Logic. LICS 2023: 1-13 - [i12]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying over Trees in Monadic Second-Order Logic. CoRR abs/2304.11613 (2023) - [i11]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Alternating (In)Dependence-Friendly Logic. CoRR abs/2304.11652 (2023) - 2022
- [j18]Paolo Pareti, George Konstantinidis, Fabio Mogavero:
Satisfiability and containment of recursive SHACL. J. Web Semant. 74: 100721 (2022) - [c33]Massimo Benerecetti, Fabio Mogavero, Adriano Peron:
Taming Strategy Logic: Non-Recurrent Fragments. TIME 2022: 14:1-14:16 - 2021
- [c32]Massimo Benerecetti, Fabio Mogavero, Adriano Peron, Luigi Libero Lucio Starace:
Expressing Structural Temporal Properties of Safety Critical Hierarchical Systems. QUATIC 2021: 356-369 - [i10]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Good-for-Game QPTL: An Alternating Hodges Semantics. CoRR abs/2104.06085 (2021) - [i9]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian Flair. CoRR abs/2105.01738 (2021) - [i8]Paolo Pareti, George Konstantinidis, Fabio Mogavero:
Satisfiability and Containment of Recursive SHACL. CoRR abs/2108.13063 (2021) - 2020
- [j17]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust worst cases for parity games algorithms. Inf. Comput. 272: 104501 (2020) - [c31]Paolo Pareti, George Konstantinidis, Fabio Mogavero, Timothy J. Norman:
SHACL Satisfiability and Containment. ISWC (1) 2020: 474-493 - [c30]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. TACAS (2) 2020: 289-306 - [i7]Massimo Benerecetti, Daniele Dell'Erba, Marco Faella, Fabio Mogavero:
From Quasi-Dominions to Progress Measures. CoRR abs/2008.04232 (2020) - [i6]Paolo Pareti, George Konstantinidis, Fabio Mogavero, Timothy J. Norman:
SHACL Satisfiability and Containment (Extended Paper). CoRR abs/2009.09806 (2020)
2010 – 2019
- 2019
- [c29]Erman Acar, Massimo Benerecetti, Fabio Mogavero:
Satisfiability in Strategy Logic Can Be Easier than Model Checking. AAAI 2019: 2638-2645 - [c28]Ruggero Lanotte, Massimo Merro, Fabio Mogavero:
On the decidability of linear bounded periodic cyber-physical systems. HSCC 2019: 87-98 - [c27]George Konstantinidis, Fabio Mogavero:
Attacking Diophantus: Solving a Special Case of Bag Containment. PODS 2019: 399-413 - [i5]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. CoRR abs/1907.06264 (2019) - 2018
- [j16]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving parity games via priority promotion. Formal Methods Syst. Des. 52(2): 193-226 (2018) - [j15]Vadim Malvone, Fabio Mogavero, Aniello Murano, Loredana Sorrentino:
Reasoning about graded strategy quantifiers. Inf. Comput. 259(3): 390-411 (2018) - [j14]Petr Cermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano:
Practical verification of multi-agent systems against Slk specifications. Inf. Comput. 261: 588-614 (2018) - [j13]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A delayed promotion policy for parity games. Inf. Comput. 262: 221-240 (2018) - [j12]Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle detection in computation tree logic. Inf. Comput. 262: 265-279 (2018) - 2017
- [j11]Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Reasoning about Strategies: on the Satisfiability Problem. Log. Methods Comput. Sci. 13(1) (2017) - [j10]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Preface to the Special Issue on SR 2014. Inf. Comput. 254: 141-142 (2017) - [c26]Michael Benedikt, Egor V. Kostylev, Fabio Mogavero, Efthymia Tsamoura:
Reformulating Queries: Theory and Practice. IJCAI 2017: 837-843 - [c25]Simone Bova, Fabio Mogavero:
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. LICS 2017: 1-12 - [c24]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games. GandALF 2017: 121-135 - 2016
- [j9]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Relentful strategic reasoning in alternating-time temporal logic. J. Log. Comput. 26(5): 1663-1695 (2016) - [c23]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Parity Games via Priority Promotion. CAV (2) 2016: 270-290 - [c22]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Improving Priority Promotion for Parity Games. Haifa Verification Conference 2016: 117-133 - [c21]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A Delayed Promotion Policy for Parity Games. GandALF 2016: 30-45 - [c20]Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle Detection in Computation Tree Logic. GandALF 2016: 164-177 - 2015
- [j8]Fabio Mogavero, Aniello Murano, Loredana Sorrentino:
On Promptness in Parity Games. Fundam. Informaticae 139(3): 277-305 (2015) - [j7]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Special issue on SR 2013. Inf. Comput. 242: 1 (2015) - [j6]Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Reasoning About Substructures and Games. ACM Trans. Comput. Log. 16(3): 25:1-25:51 (2015) - [c19]Fabio Mogavero, Giuseppe Perelli:
Binding Forms in First-Order Logic. CSL 2015: 648-665 - [c18]Vadim Malvone, Fabio Mogavero, Aniello Murano, Loredana Sorrentino:
On the Counting of Strategies. TIME 2015: 170-179 - 2014
- [j5]Benjamin Aminof, Fabio Mogavero, Aniello Murano:
Synthesis of hierarchical systems. Sci. Comput. Program. 83: 56-79 (2014) - [j4]Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Reasoning About Strategies: On the Model-Checking Problem. ACM Trans. Comput. Log. 15(4): 34:1-34:47 (2014) - [c17]Fabio Mogavero, Aniello Murano, Luigi Sauro:
Strategy games: a renewed framework. AAMAS 2014: 869-876 - [c16]Petr Cermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano:
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. CAV 2014: 525-532 - [c15]Fabio Mogavero, Aniello Murano, Luigi Sauro:
A Behavioral Hierarchy of Strategy Logic. CLIMA 2014: 148-165 - [e2]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Proceedings 2nd International Workshop on Strategic Reasoning, SR 2014, Grenoble, France, April 5-6, 2014. EPTCS 146, 2014 [contents] - [i4]Petr Cermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano:
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications. CoRR abs/1402.2948 (2014) - [i3]Fabio Mogavero, Giuseppe Perelli:
On the Remarkable Features of Binding Forms. CoRR abs/1404.1531 (2014) - 2013
- [b2]Fabio Mogavero:
Logics in Computer Science - A Study on Extensions of Temporal and Strategic Logics. Atlantis Studies in Computing 3, Atlantis Press 2013, ISBN 978-94-91216-94-7, pp. I-XVII, 1-149 - [c14]Fabio Mogavero, Aniello Murano, Luigi Sauro:
On the Boundary of Behavioral Strategies. LICS 2013: 263-272 - [c13]Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Substructure Temporal Logic. LICS 2013: 368-377 - [c12]Fabio Mogavero, Aniello Murano, Loredana Sorrentino:
On Promptness in Parity Games. LPAR 2013: 601-618 - [e1]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Proceedings 1st International Workshop on Strategic Reasoning, SR 2013, Rome, Italy, March 16-17, 2013. EPTCS 112, 2013 [contents] - 2012
- [j3]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Quantitatively fair scheduling. Theor. Comput. Sci. 413(1): 160-175 (2012) - [j2]Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded computation tree logic. ACM Trans. Comput. Log. 13(3): 25:1-25:53 (2012) - [c11]Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic. CONCUR 2012: 193-208 - [i2]Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
A Decidable Fragment of Strategy Logic. CoRR abs/1202.1309 (2012) - 2011
- [j1]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Exploring the boundary of half-positionality. Ann. Math. Artif. Intell. 62(1-2): 55-77 (2011) - [c10]Benjamin Aminof, Fabio Mogavero, Aniello Murano:
Synthesis of Hierarchical Systems. FACS 2011: 42-60 - [i1]Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi:
Reasoning About Strategies: On the Model-Checking Problem. CoRR abs/1112.6275 (2011) - 2010
- [b1]Fabio Mogavero:
Logics in Computer Science. University of Naples Federico II, Italy, 2010 - [c9]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Exploring the Boundary of Half Positionality. CLIMA 2010: 171-185 - [c8]Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded Computation Tree Logic with Binary Coding. CSL 2010: 125-139 - [c7]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Reasoning About Strategies. FSTTCS 2010: 133-144 - [c6]Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Relentful Strategic Reasoning in Alternating-Time Temporal Logic. LPAR (Dakar) 2010: 371-386 - [c5]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Quantitative Fairness Games. QAPL 2010: 48-63
2000 – 2009
- 2009
- [c4]Fabio Mogavero, Aniello Murano:
Branching-Time Temporal Logics with Minimal Model Quantifiers. Developments in Language Theory 2009: 396-409 - [c3]Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded Computation Tree Logic. LICS 2009: 342-351 - [c2]Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano:
Balanced Paths in Colored Graphs. MFCS 2009: 149-161 - 2008
- [c1]Piero A. Bonatti, Fabio Mogavero:
Comparing Rule-Based Policies. POLICY 2008: 11-18
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-10-23 21:27 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:
