Mathieu Sassolas

25 papers A 1B 1C 2Journal 14Unranked 6
YearRankTypeTitle / Venue / Authors
2025 A conf
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents.
CSF
Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard
2024 J jnl
Pessimism of the Will, Optimism of the Intellect: Fair Protocols with Malicious but Rational Agents.
CoRR
Léonard Brice, Jean-François Raskin, Mathieu Sassolas, Guillaume Scerri, Marie van den Bogaard
2021 J jnl
Polynomial interrupt timed automata: Verification and expressiveness.
Inf. Comput.
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2018 J jnl
Detection of security vulnerabilities in C language applications.
Secur. Priv.
El Habib Boudjema, Christèle Faure, Mathieu Sassolas, Lynda Mokdad
2018 J jnl
Opacity for linear constraint Markov chains.
Discret. Event Dyn. Syst.
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
2017 — conf
Modeling DoS attacks in WSNs with quantitative games.
ICC
Quentin Monnet, Mathieu Sassolas, Lynda Mokdad
2016 C conf
Non-Zero Sum Games for Reactive Synthesis.
LATA
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2016 — conf
Preserving opacity on Interval Markov Chains under simulation.
WODES
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
2015 J jnl
Non-Zero Sum Games for Reactive Synthesis.
CoRR
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2015 — conf
Polynomial Interrupt Timed Automata.
RP
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2015 J jnl
Polynomial Interrupt Timed Automata.
CoRR
Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas
2015 J jnl
Probabilistic Opacity in Refinement-Based Modeling.
CoRR
Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas
2015 J jnl
Quantifying opacity.
Math. Struct. Comput. Sci.
Béatrice Bérard, John Mullins, Mathieu Sassolas
2014 — conf
The complexity of admissibility in Omega-regular games.
CSL-LICS
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
2013 J jnl
Quantifying Opacity
CoRR
Béatrice Bérard, John Mullins, Mathieu Sassolas
2013 J jnl
The Complexity of Admissibility in Omega-Regular Games
CoRR
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
2012 J jnl
Channel Synthesis for Finite Transducers.
Int. J. Found. Comput. Sci.
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas
2012 B conf
Concurrent Games on VASS with Inhibition.
CONCUR
Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder
2012 J jnl
Interrupt Timed Automata: verification and expressiveness
CoRR
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
2012 J jnl
Interrupt Timed Automata: verification and expressiveness.
Formal Methods Syst. Des.
Béatrice Bérard, Serge Haddad, Mathieu Sassolas
2011 — conf
Channel Synthesis for Finite Transducers.
AFL
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas
2011 J jnl
Exploring inconsistencies between modal transition systems.
Softw. Syst. Model.
Mathieu Sassolas, Marsha Chechik, Sebastián Uchitel
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
2010 — conf
Quantifying Opacity.
QEST
Béatrice Bérard, John Mullins, Mathieu Sassolas
2010 C conf
Real Time Properties for Interrupt Timed Automata.
TIME
Béatrice Bérard, Serge Haddad, Mathieu Sassolas