Follow
Benoît Barbot
Benoît Barbot
LACL, Université Paris-Est Créteil
Verified email at lacl.fr - Homepage
Title
Cited by
Cited by
Year
HASL: A new approach for performance evaluation and model checking from concepts to experimentation
P Ballarini, B Barbot, M Duflot, S Haddad, N Pekergin
Performance Evaluation 90, 53-77, 2015
612015
Coupling and importance sampling for statistical model checking
B Barbot, S Haddad, C Picaronny
Tools and Algorithms for the Construction and Analysis of Systems: 18th …, 2012
562012
Efficient CTMC model checking of linear real-time objectives
B Barbot, T Chen, T Han, JP Katoen, A Mereacre
Tools and Algorithms for the Construction and Analysis of Systems: 17th …, 2011
512011
Estimation and verification of hybrid heart models for personalised medical and wearable devices
B Barbot, M Kwiatkowska, A Mereacre, N Paoletti
Computational Methods in Systems Biology: 13th International Conference …, 2015
202015
On quantitative modelling and verification of DNA walker circuits using stochastic Petri nets
B Barbot, M Kwiatkowska
Application and Theory of Petri Nets and Concurrency: 36th International …, 2015
172015
Uniform sampling for timed automata with application to language inclusion measurement
B Barbot, N Basset, M Beunardeau, M Kwiatkowska
Quantitative Evaluation of Systems: 13th International Conference, QEST 2016 …, 2016
162016
Falsification of cyber-physical systems with constrained signal spaces
B Barbot, N Basset, T Dang, A Donzé, J Kapinski, T Yamaguchi
NASA Formal Methods: 12th International Symposium, NFM 2020, Moffett Field …, 2020
132020
Integrating simulink models into the model checker cosmos
B Barbot, B Bérard, Y Duplouy, S Haddad
Application and Theory of Petri Nets and Concurrency: 39th International …, 2018
122018
Generation of signals under temporal constraints for CPS testing
B Barbot, N Basset, T Dang
NASA Formal Methods: 11th International Symposium, NFM 2019, Houston, TX …, 2019
112019
A modular approach for reusing formalisms in verification tools of concurrent systems
É André, B Barbot, C Démoulins, LM Hillah, F Hulin-Hubard, F Kordon, ...
Formal Methods and Software Engineering: 15th International Conference on …, 2013
112013
Property-directed verification and robustness certification of recurrent neural networks
I Khmelnitsky, D Neider, R Roy, X Xie, B Barbot, B Bollig, A Finkel, ...
Automated Technology for Verification and Analysis: 19th International …, 2021
102021
Statistical model-checking for autonomous vehicle safety validation
B Barbot, B Bérard, Y Duplouy, S Haddad
Conference SIA Simulation Numérique, 2017
102017
Acceleration for statistical model checking
B Barbot
École normale supérieure de Cachan-ENS Cachan, 2014
102014
Building power consumption models from executable timed I/O automata specifications
B Barbot, M Kwiatkowska, A Mereacre, N Paoletti
Proceedings of the 19th International Conference on Hybrid Systems …, 2016
92016
Importance sampling for model checking of continuous time markov chains
B Barbot, S Haddad, C Picaronny
SIMUL, 30-35, 2012
82012
Simulation-based verification of hybrid automata stochastic logic formulas for stochastic symmetric nets
EG Amparore, B Barbot, M Beccuti, S Donatelli, G Franceschinis
Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced …, 2013
72013
Extracting context-free grammars from recurrent neural networks using tree-automata learning and a* search
B Barbot, B Bollig, A Finkel, S Haddad, I Khmelnitsky, M Leucker, ...
International Conference on Grammatical Inference, 113-129, 2021
52021
Rare event handling in signalling cascades
B Barbot, S Haddad, M Heiner, C Picaronny
Int. J. Adv. Syst. Meas 8 (1-2), 69-79, 2015
42015
Property-directed verification of recurrent neural networks
I Khmelnitsky, D Neider, R Roy, B Barbot, B Bollig, A Finkel, S Haddad, ...
arXiv preprint arXiv:2009.10610, 2020
32020
Échantillonnage préférentiel pour le model checking statistique
B Barbot, S Haddad, C Picaronny
Journal européen des systèmes automatisés 45 (1-3), 237-252, 2011
22011
The system can't perform the operation now. Try again later.
Articles 1–20