Mathieu Sassolas

According to our database, Mathieu Sassolas authored at least 17 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents.

Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard

CoRR, 2024

2021

Polynomial interrupt timed automata: Verification and expressiveness.

Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas

Inf. Comput., 2021

2018

Detection of security vulnerabilities in C language applications.

El Habib Boudjema, Christèle Faure, Mathieu Sassolas, Lynda Mokdad

Secur. Priv., 2018

Opacity for linear constraint Markov chains.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

Discret. Event Dyn. Syst., 2018

2017

Modeling DoS attacks in WSNs with quantitative games.

Quentin Monnet, Mathieu Sassolas, Lynda Mokdad

Proceedings of the IEEE International Conference on Communications, 2017

2016

Preserving opacity on Interval Markov Chains under simulation.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

Proceedings of the 13th International Workshop on Discrete Event Systems, 2016

Non-Zero Sum Games for Reactive Synthesis.

Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Quantifying opacity.

Béatrice Bérard, John Mullins, Mathieu Sassolas

Math. Struct. Comput. Sci., 2015

Probabilistic Opacity in Refinement-Based Modeling.

Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

CoRR, 2015

Polynomial Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas

Proceedings of the Reachability Problems - 9th International Workshop, 2015

2014

The complexity of admissibility in Omega-regular games.

Romain Brenguier, Jean-François Raskin, Mathieu Sassolas

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2012

Channel Synthesis for Finite Transducers.

Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas

Int. J. Found. Comput. Sci., 2012

Interrupt Timed Automata: verification and expressiveness.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas

Formal Methods Syst. Des., 2012

Concurrent Games on VASS with Inhibition.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Méthodes qualitatives et quantitatives pour la détection d'information cachée. (Qualitative and Quantitative Methods for Detection of Hidden Information).

Mathieu Sassolas

PhD thesis, 2011

Exploring inconsistencies between modal transition systems.

Mathieu Sassolas, Marsha Chechik, Sebastián Uchitel

Softw. Syst. Model., 2011

2010

Real Time Properties for Interrupt Timed Automata.

Béatrice Bérard, Serge Haddad, Mathieu Sassolas

Proceedings of the TIME 2010, 2010