Massimo Benerecetti

Orcid: 0000-0003-4664-6061

According to our database1, Massimo Benerecetti authored at least 61 papers between 1996 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Priority Promotion with Parysian flair.
J. Comput. Syst. Sci., 2025

2024
Solving mean-payoff games via quasi dominions.
Inf. Comput., 2024

Model Checking Linear Temporal Properties on Polyhedral Systems.
Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, 2024

Full Characterisation of Extended CTL.
Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, 2024

Automata-Theoretic Characterisations of Branching-Time Temporal Logics.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Alternating (In)Dependence-Friendly Logic.
Ann. Pure Appl. Log., December, 2023

Taming Strategy Logic: Non-Recurrent Fragments.
Inf. Comput., October, 2023

Good-for-Game QPTL: An Alternating Hodges Semantics.
ACM Trans. Comput. Log., January, 2023

Quantifying Over Trees in Monadic Second-Order Logic.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2021
Expressing Structural Temporal Properties of Safety Critical Hierarchical Systems.
Proceedings of the Quality of Information and Communications Technology, 2021

2020
An OSLC-based environment for system-level functional testing of ERTMS/ETCS controllers.
J. Syst. Softw., 2020

Robust worst cases for parity games algorithms.
Inf. Comput., 2020

From Quasi-Dominions to Progress Measures.
CoRR, 2020

2019
From Dynamic State Machines to Promela.
Proceedings of the Model Checking Software - 26th International Symposium, 2019

Satisfiability in Strategy Logic Can Be Easier than Model Checking.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Solving parity games via priority promotion.
Formal Methods Syst. Des., 2018

2017
Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control.
ACM Trans. Embed. Comput. Syst., 2017

Dynamic state machines for modelling railway control systems.
Sci. Comput. Program., 2017

Tracking smooth trajectories in linear hybrid systems.
Inf. Comput., 2017

Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

2016
Timed recursive state machines: Expressiveness and complexity.
Theor. Comput. Sci., 2016

A distributed architecture to integrate ontological knowledge into information extraction.
Int. J. Grid Util. Comput., 2016

A Delayed Promotion Policy for Parity Games.
Proceedings of the Seventh International Symposium on Games, 2016

Improving Priority Promotion for Parity Games.
Proceedings of the Hardware and Software: Verification and Testing, 2016

2015
Reasoning About Substructures and Games.
ACM Trans. Comput. Log., 2015

Modeling Railway Control Systems in Promela.
Proceedings of the Formal Techniques for Safety-Critical Systems, 2015

2014
Counterexample-guided abstraction refinement for linear programs with arrays.
Autom. Softw. Eng., 2014

Dynamic State Machines for Formalizing Railway Control System Specifications.
Proceedings of the Formal Techniques for Safety-Critical Systems, 2014

A Distributed Information Extraction System Integrating Ontological Knowledge and Probabilistic Classifiers.
Proceedings of the 2014 Ninth International Conference on P2P, 2014

2013
Automatic synthesis of switching controllers for linear hybrid systems: Safety control.
Theor. Comput. Sci., 2013

Timed protocol insecurity problem is NP-complete.
Future Gener. Comput. Syst., 2013

Substructure Temporal Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Tracking differentiable trajectories across polyhedra boundaries.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

2012
Reachability games for linear hybrid systems.
Proceedings of the Hybrid Systems: Computation and Control (part of CPS Week 2012), 2012

2011
Towards Efficient Exact Synthesis for Linear Hybrid Systems
Proceedings of Second International Symposium on Games, 2011

Automatic Synthesis of Switching Controllers for Linear Hybrid Automata
CoRR, 2011

Revisiting synthesis of switching controllers for Linear Hybrid systems.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
Analysis of Timed Recursive State Machines.
Proceedings of the TIME 2010, 2010

Timed protocols insecurity problem is NP-complete.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

2009
TPMC: A Model Checker For Time-Sensitive Security Protocols.
J. Comput., 2009

2007
Abstraction Refinement of Linear Programs with Arrays.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

The eureka tool for software model checking.
Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007), 2007

2005
Model Checking Linear Programs with Arrays.
Proceedings of the 3rd Workshop on Software Model Checking, 2005

Soundness of Schema Matching Methods.
Proceedings of the Semantic Web: Research and Applications, 2005

2003
Verification of recursive parallel systems
CoRR, 2003

2002
Verification of the SSL/TLS Protocol Using a Model Checkable Logic of Belief and Time.
Proceedings of the Computer Safety, 2002

Verification of Payment Protocols via MultiAgent Model Checking.
Proceedings of the Advanced Information Systems Engineering, 14th International Conference, 2002

Validation of Multiagent Systems by Symbolic Model Checking.
Proceedings of the Agent-Oriented Software Engineering III, Third International Workshop, 2002

2001
Distributed Context-Aware Systems.
Hum. Comput. Interact., 2001

On the Dimensions of Context Dependence: Partiality, Approximation, and Perspective.
Proceedings of the Modeling and Using Context, 2001

2000
Contextual reasoning distilled.
J. Exp. Theor. Artif. Intell., 2000

Model Checking Security Protocols Using a Logic of Belief.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

A Logic of Belief and a Model Checking Algorithm for Security Protocols.
Proceedings of the Formal Techniques for Distributed System Development, 2000

Model Checking-Based Analysis of Multiagent Systems.
Proceedings of the Formal Approaches to Agent-Based Systems, First International Workshop, 2000

1999
Formal specification of beliefs in multi-agent systems.
Int. J. Intell. Syst., 1999

1998
Model Checking Multiagent Systems.
J. Log. Comput., 1998

Multiagent Systems Verification via Model Checking.
Proceedings of the 1998 European Workshop on Validation and Verification of Knowledge-Based Systems, 1998

A Model Checking Algorithm for Multiagent Systems.
Proceedings of the Intelligent Agents V, 1998

Formalizing Belief Reports - The Approach and a Case Study.
Proceedings of the Artificial Intelligence: Methodology, 1998

1996
METAFOL: Program tactics and logic tactics plus reflection.
Future Gener. Comput. Syst., 1996

Formal Specification of Beliefs in Multi-Agent Systems.
Proceedings of the Intelligent Agents III, 1996


  Loading...