default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimo Benerecetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j24]Massimo Benerecetti, Daniele Dell'Erba
, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian flair. J. Comput. Syst. Sci. 147: 103580 (2025)- 2024
- [j23]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving mean-payoff games via quasi dominions. Inf. Comput. 297: 105151 (2024) - [c38]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. ICALP 2024: 128:1-128:20 - [c37]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Full Characterisation of Extended CTL. TIME 2024: 18:1-18:18 - [c36]Massimo Benerecetti, Marco Faella, Fabio Mogavero:
Model Checking Linear Temporal Properties on Polyhedral Systems. TIME 2024: 19:1-19:23 - [i9]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. CoRR abs/2404.17421 (2024) - 2023
- [j22]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Alternating (In)Dependence-Friendly Logic. Ann. Pure Appl. Log. 174(10): 103315 (2023) - [j21]Massimo Benerecetti, Fabio Mogavero, Adriano Peron:
Taming Strategy Logic: Non-Recurrent Fragments. Inf. Comput. 294: 105081 (2023) - [j20]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) - [c35]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying Over Trees in Monadic Second-Order Logic. LICS 2023: 1-13 - [i8]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying over Trees in Monadic Second-Order Logic. CoRR abs/2304.11613 (2023) - [i7]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Alternating (In)Dependence-Friendly Logic. CoRR abs/2304.11652 (2023) - 2022
- [c34]Massimo Benerecetti, Fabio Mogavero, Adriano Peron:
Taming Strategy Logic: Non-Recurrent Fragments. TIME 2022: 14:1-14:16 - 2021
- [c33]Massimo Benerecetti, Fabio Mogavero, Adriano Peron, Luigi Libero Lucio Starace:
Expressing Structural Temporal Properties of Safety Critical Hierarchical Systems. QUATIC 2021: 356-369 - [i6]Dylan Bellier, Massimo Benerecetti, Dario Della Monica, Fabio Mogavero:
Good-for-Game QPTL: An Alternating Hodges Semantics. CoRR abs/2104.06085 (2021) - [i5]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, Sven Schewe, Dominik Wojtczak:
Priority Promotion with Parysian Flair. CoRR abs/2105.01738 (2021) - 2020
- [j19]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust worst cases for parity games algorithms. Inf. Comput. 272: 104501 (2020) - [j18]Roberto Nardone, Stefano Marrone, Ugo Gentile, Aniello Amato, Gregorio Barberio, Massimo Benerecetti, Renato De Guglielmo, Beniamino Di Martino, Nicola Mazzocca, Adriano Peron, Gaetano Pisani, Luigi Velardi, Valeria Vittorini:
An OSLC-based environment for system-level functional testing of ERTMS/ETCS controllers. J. Syst. Softw. 161 (2020) - [c32]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. TACAS (2) 2020: 289-306 - [i4]Massimo Benerecetti, Daniele Dell'Erba, Marco Faella, Fabio Mogavero:
From Quasi-Dominions to Progress Measures. CoRR abs/2008.04232 (2020)
2010 – 2019
- 2019
- [c31]Erman Acar, Massimo Benerecetti, Fabio Mogavero:
Satisfiability in Strategy Logic Can Be Easier than Model Checking. AAAI 2019: 2638-2645 - [c30]Massimo Benerecetti, Ugo Gentile, Stefano Marrone, Roberto Nardone, Adriano Peron, Luigi L. L. Starace, Valeria Vittorini:
From Dynamic State Machines to Promela. SPIN 2019: 56-73 - [i3]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Mean-Payoff Games via Quasi Dominions. CoRR abs/1907.06264 (2019) - 2018
- [j17]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving parity games via priority promotion. Formal Methods Syst. Des. 52(2): 193-226 (2018) - [j16]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A delayed promotion policy for parity games. Inf. Comput. 262: 221-240 (2018) - 2017
- [j15]Massimo Benerecetti, Marco Faella:
Tracking smooth trajectories in linear hybrid systems. Inf. Comput. 257: 114-138 (2017) - [j14]Massimo Benerecetti, Renato De Guglielmo, Ugo Gentile, Stefano Marrone, Nicola Mazzocca, Roberto Nardone, Adriano Peron, Luigi Velardi, Valeria Vittorini:
Dynamic state machines for modelling railway control systems. Sci. Comput. Program. 133: 116-153 (2017) - [j13]Massimo Benerecetti, Marco Faella:
Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control. ACM Trans. Embed. Comput. Syst. 16(4): 104:1-104:27 (2017) - [c29]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games. GandALF 2017: 121-135 - 2016
- [j12]Anita Alicante, Massimo Benerecetti, Anna Corazza, Stefano Silvestri:
A distributed architecture to integrate ontological knowledge into information extraction. Int. J. Grid Util. Comput. 7(4): 245-256 (2016) - [j11]Massimo Benerecetti, Adriano Peron:
Timed recursive state machines: Expressiveness and complexity. Theor. Comput. Sci. 625: 85-124 (2016) - [c28]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Solving Parity Games via Priority Promotion. CAV (2) 2016: 270-290 - [c27]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Improving Priority Promotion for Parity Games. Haifa Verification Conference 2016: 117-133 - [c26]Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A Delayed Promotion Policy for Parity Games. GandALF 2016: 30-45 - 2015
- [j10]Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Reasoning About Substructures and Games. ACM Trans. Comput. Log. 16(3): 25:1-25:51 (2015) - [c25]Roberto Nardone, Ugo Gentile, Massimo Benerecetti, Adriano Peron, Valeria Vittorini, Stefano Marrone, Nicola Mazzocca:
Modeling Railway Control Systems in Promela. FTSCS 2015: 121-136 - 2014
- [j9]Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani:
Counterexample-guided abstraction refinement for linear programs with arrays. Autom. Softw. Eng. 21(2): 225-285 (2014) - [c24]Anita Alicante, Massimo Benerecetti, Anna Corazza, Stefano Silvestri:
A Distributed Information Extraction System Integrating Ontological Knowledge and Probabilistic Classifiers. 3PGCIC 2014: 420-425 - [c23]Roberto Nardone, Ugo Gentile, Adriano Peron, Massimo Benerecetti, Valeria Vittorini, Stefano Marrone, Renato De Guglielmo, Nicola Mazzocca, Luigi Velardi:
Dynamic State Machines for Formalizing Railway Control System Specifications. FTSCS 2014: 93-109 - 2013
- [j8]Massimo Benerecetti, Adriano Peron:
Timed protocol insecurity problem is NP-complete. Future Gener. Comput. Syst. 29(3): 843-862 (2013) - [j7]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Automatic synthesis of switching controllers for linear hybrid systems: Safety control. Theor. Comput. Sci. 493: 116-138 (2013) - [c22]Massimo Benerecetti, Marco Faella:
Tracking differentiable trajectories across polyhedra boundaries. HSCC 2013: 193-202 - [c21]Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Substructure Temporal Logic. LICS 2013: 368-377 - 2012
- [c20]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Reachability games for linear hybrid systems. HSCC 2012: 65-74 - 2011
- [c19]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Revisiting synthesis of switching controllers for Linear Hybrid systems. CDC/ECC 2011: 4753-4758 - [c18]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Towards Efficient Exact Synthesis for Linear Hybrid Systems. GandALF 2011: 263-277 - [i2]Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Automatic Synthesis of Switching Controllers for Linear Hybrid Automata. CoRR abs/1103.4584 (2011) - 2010
- [c17]Massimo Benerecetti, Nicola Cuomo, Adriano Peron:
Timed protocols insecurity problem is NP-complete. HPCS 2010: 274-282 - [c16]Massimo Benerecetti, Stefano Minopoli, Adriano Peron:
Analysis of Timed Recursive State Machines. TIME 2010: 61-68
2000 – 2009
- 2009
- [j6]Massimo Benerecetti, Nicola Cuomo, Adriano Peron:
TPMC: A Model Checker For Time-Sensitive Security Protocols. J. Comput. 4(5): 366-377 (2009) - 2007
- [c15]Alessandro Armando, Massimo Benerecetti, Dario Carotenuto, Jacopo Mantovani, Pasquale Spica:
The eureka tool for software model checking. ASE 2007: 541-542 - [c14]Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani:
Abstraction Refinement of Linear Programs with Arrays. TACAS 2007: 373-388 - 2005
- [c13]Massimo Benerecetti, Paolo Bouquet, Stefano Zanobini:
Soundness of Schema Matching Methods. ESWC 2005: 211-225 - [c12]Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani:
Model Checking Linear Programs with Arrays. SoftMC@CAV 2005: 79-94 - 2003
- [i1]Laura Bozzelli, Massimo Benerecetti, Adriano Peron:
Verification of recursive parallel systems. CoRR cs.OH/0312019 (2003) - 2002
- [c11]Massimo Benerecetti, Alessandro Cimatti:
Validation of Multiagent Systems by Symbolic Model Checking. AOSE 2002: 32-46 - [c10]Massimo Benerecetti, Maurizio Panti, Luca Spalazzi, Simone Tacconi:
Verification of Payment Protocols via MultiAgent Model Checking. CAiSE 2002: 311-327 - [c9]Massimo Benerecetti, Maurizio Panti, Luca Spalazzi, Simone Tacconi:
Verification of the SSL/TLS Protocol Using a Model Checkable Logic of Belief and Time. SAFECOMP 2002: 126-138 - 2001
- [j5]Massimo Benerecetti, Paolo Bouquet, Matteo Bonifacio:
Distributed Context-Aware Systems. Hum. Comput. Interact. 16(2-4): 213-228 (2001) - [c8]Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini:
On the Dimensions of Context Dependence: Partiality, Approximation, and Perspective. CONTEXT 2001: 59-72 - 2000
- [j4]Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini:
Contextual reasoning distilled. J. Exp. Theor. Artif. Intell. 12(3): 279-305 (2000) - [c7]Massimo Benerecetti, Fausto Giunchiglia:
Model Checking-Based Analysis of Multiagent Systems. FAABS 2000: 1-15 - [c6]Massimo Benerecetti, Fausto Giunchiglia, Maurizio Panti, Luca Spalazzi:
A Logic of Belief and a Model Checking Algorithm for Security Protocols. FORTE 2000: 393-408 - [c5]Massimo Benerecetti, Fausto Giunchiglia:
Model Checking Security Protocols Using a Logic of Belief. TACAS 2000: 519-534
1990 – 1999
- 1999
- [j3]Massimo Benerecetti, Enrico Giunchiglia, Luciano Serafini, Adolfo Villafiorita:
Formal specification of beliefs in multi-agent systems. Int. J. Intell. Syst. 14(10): 1021-1040 (1999) - [e1]Paolo Bouquet, Luciano Serafini, Patrick Brézillon, Massimo Benerecetti, F. Castellani:
Modeling and Using Context, Second International and Interdisciplinary Conference, CONTEXT'99, Trento, Italy, September 1999, Proceedings. Lecture Notes in Computer Science 1688, Springer 1999, ISBN 3-540-66432-7 [contents] - 1998
- [j2]Massimo Benerecetti, Fausto Giunchiglia, Luciano Serafini:
Model Checking Multiagent Systems. J. Log. Comput. 8(3): 401-423 (1998) - [c4]Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini:
Formalizing Belief Reports - The Approach and a Case Study. AIMSA 1998: 62-75 - [c3]Massimo Benerecetti, Fausto Giunchiglia, Luciano Serafini:
A Model Checking Algorithm for Multiagent Systems. ATAL 1998: 163-176 - [c2]Massimo Benerecetti, Fausto Giunchiglia, Luciano Serafini:
Multiagent Systems Verification via Model Checking. EUROVAV 1998 - 1996
- [j1]Massimo Benerecetti, Luca Spalazzi:
METAFOL: Program tactics and logic tactics plus reflection. Future Gener. Comput. Syst. 12(2-3): 139-156 (1996) - [c1]Massimo Benerecetti, Alessandro Cimatti, Enrico Giunchiglia, Fausto Giunchiglia, Luciano Serafini:
Formal Specification of Beliefs in Multi-Agent Systems. ATAL 1996: 117-130
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 20:36 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:
