Nicolas Mazzocchi

Orcid: 0000-0001-6425-5369

Affiliations:
  • IMDEA Software Institute, Madrid, Spain


According to our database1, Nicolas Mazzocchi authored at least 17 papers between 2019 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
Safety and Liveness of Quantitative Properties and Automata.
Log. Methods Comput. Sci., 2025

Automating the Analysis of Quantitative Automata with QuAK.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2025

Quantitative Language Automata.
Proceedings of the 36th International Conference on Concurrency Theory, 2025

Temporal Explorability Games.
Proceedings of the 36th International Conference on Concurrency Theory, 2025

2024
QuAK: Quantitative Automata Kit.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Software Engineering Methodologies, 2024

Strategic Dominance: A New Preorder for Nondeterministic Processes.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023
Regular Methods for Operator Precedence Languages.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Quantitative Safety and Liveness.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Safety and Liveness of Quantitative Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Abstract Monitors for Quantitative Specifications.
Proceedings of the Runtime Verification - 22nd International Conference, 2022

FORQ-Based Language Inclusion Formal Testing.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Decomposing Permutation Automata.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
A Pattern Logic for Automata with Outputs.
Int. J. Found. Comput. Sci., 2020

Unary Prime Languages.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Weighted Transducers for Robustness Verification.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Decidable weighted expressions with Presburger combinators.
J. Comput. Syst. Sci., 2019

Two-Way Parikh Automata.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019


  Loading...