Real Time Properties for Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas (TIME, 2010)

Exploring inconsistencies between modal transition systems. - Mathieu Sassolas; Marsha Chechik; Sebastián Uchitel (Softw. Syst. Model., 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 (2011)

Concurrent Games on VASS with Inhibition. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas; Nathalie Sznajder (CONCUR, 2012)

Interrupt Timed Automata: verification and expressiveness. - Béatrice Bérard; Serge Haddad; Mathieu Sassolas (Formal Methods Syst. Des., 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)

The complexity of admissibility in Omega-regular games. - Romain Brenguier; Jean-François Raskin; Mathieu Sassolas (CSL-LICS, 2014)

Polynomial Interrupt Timed Automata. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (RP, 2015)

Probabilistic Opacity in Refinement-Based Modeling. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (CoRR, 2015)

Quantifying opacity. - Béatrice Bérard; John Mullins; Mathieu Sassolas (Math. Struct. Comput. Sci., 2015)

Non-Zero Sum Games for Reactive Synthesis. - Romain Brenguier; Lorenzo Clemente; Paul Hunter 001; Guillermo A. Pérez 001; Mickael Randour; Jean-François Raskin; Ocan Sankur; Mathieu Sassolas (LATA, 2016)

Preserving opacity on Interval Markov Chains under simulation. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (WODES, 2016)

Modeling DoS attacks in WSNs with quantitative games. - Quentin Monnet; Mathieu Sassolas; Lynda Mokdad (ICC, 2017)

Opacity for linear constraint Markov chains. - Béatrice Bérard; Olga Kouchnarenko; John Mullins; Mathieu Sassolas (Discret. Event Dyn. Syst., 2018)

Detection of security vulnerabilities in C language applications. - El Habib Boudjema; Christèle Faure; Mathieu Sassolas; Lynda Mokdad (Secur. Priv., 2018)

Polynomial interrupt timed automata: Verification and expressiveness. - Béatrice Bérard; Serge Haddad; Claudine Picaronny; Mohab Safey El Din; Mathieu Sassolas (Inf. Comput., 2021)

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)