Matteo Mio

Orcid: 0000-0003-4050-3617

According to our database1, Matteo Mio authored at least 28 papers between 2008 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Universal Algebra for Generalised Metric Spaces.
CoRR, 2023

2022
Proof Theory of Riesz Spaces and Modal Riesz Spaces.
Log. Methods Comput. Sci., 2022

Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Free Modal Riesz Spaces are Archimedean: A Syntactic Proof.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
Probabilistic logics based on Riesz spaces.
Log. Methods Comput. Sci., 2020

Monads and Quantitative Equational Theories for Nondeterminism and Probability.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Towards a Structural Proof Theory of Probabilistic \mu -Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Monadic Second Order Logic with Measure and Category Quantifiers.
Log. Methods Comput. Sci., 2018

Riesz Modal Logic with Threshold Operators.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Measure properties of regular sets of trees.
Inf. Comput., 2017

Łukasiewicz μ-calculus.
Fundam. Informaticae, 2017

Regular Languages of Infinite Trees and Probability.
FLAP, 2017

Riesz Modal logic for Markov processes.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
On the Regular Emptiness Problem of Subzero Automata.
Proceedings of the Proceedings 9th Interaction and Concurrency Experience, 2016

Measure Quantifier in Monadic Second Order Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015
Baire Category Quantifier in Monadic Second Order Logic.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On the Problem of Computing the Probability of Regular Sets of Trees.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Measure Properties of Game Tree Languages.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Łukasiewicz mu-Calculus.
Proceedings of the Proceedings Workshop on Fixed Points in Computer Science, 2013

Upper-Expectation Bisimilarity and Real-valued Modal Logics.
CoRR, 2013

A Proof System for Compositional Verification of Probabilistic Concurrent Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Probabilistic modal μ-calculus with independent product
Log. Methods Comput. Sci., 2012

On the equivalence of game and denotational semantics for the probabilistic mu-calculus
Log. Methods Comput. Sci., 2012

2011
Probabilistic Modal <i>μ</i>-Calculus with Independent Product.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010
A Proof System for Reasoning about Probabilistic Concurrent Processes.
Proceedings of the International Workshop on Proof Systems for Program Logics, 2010

2008
PicNIc - Pi-calculus non-interference checker.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008


  Loading...