default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Barbot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Benoît Barbot:
Acceleration for statistical model checking. (Accélérations pour le model checking statistique). École normale supérieure de Cachan, France, 2014
Journal Articles
- 2024
- [j5]Adrien Le Coënt, Benoît Barbot, Nihal Pekergin:
Efficient probabilistic inference in biochemical networks. Comput. Biol. Medicine 183: 109280 (2024) - [j4]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise. Log. Methods Comput. Sci. 20(1) (2024) - 2023
- [j3]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie
, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25(3): 341-354 (2023) - 2022
- [j2]Paolo Ballarini, Benoît Barbot:
Cosmos: Evolution of a Statistical Model Checking Platform. SIGMETRICS Perform. Evaluation Rev. 49(4): 65-69 (2022) - 2015
- [j1]Paolo Ballarini, Benoît Barbot, Marie Duflot, Serge Haddad, Nihal Pekergin:
HASL: A new approach for performance evaluation and model checking from concepts to experimentation. Perform. Evaluation 90: 53-77 (2015)
Conference and Workshop Papers
- 2024
- [c21]Étienne André, Jaime Arias, Benoît Barbot, Francis Hulin-Hubard, Fabrice Kordon, Van-François Le, Laure Petrucci:
CosyVerif: The Path to Formalisms Cohabitation. Petri Nets 2024: 432-444 - [c20]Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj:
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. QEST+FORMATS 2024: 268-283 - 2023
- [c19]Adrien Le Coënt, Benoît Barbot, Nihal Pekergin, Cüneyt Güzelis:
Bayesian Networks as Approximations of Biochemical Networks. EPEW 2023: 216-233 - [c18]Benoît Barbot, Nicolas Basset, Alexandre Donzé:
Wordgen : a Timed word Generation Tool. HSCC 2023: 16:1-16:7 - [c17]Benoît Barbot, Nicolas Basset:
Max-Entropy Sampling for Deterministic Timed Automata Under Linear Duration Constraints. QEST 2023: 188-204 - 2022
- [c16]Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF 2022: 81-96 - 2021
- [c15]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA 2021: 364-380 - [c14]Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye:
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI 2021: 113-129 - 2020
- [c13]Benoît Barbot, Nicolas Basset, Thao Dang, Alexandre Donzé, James Kapinski, Tomoya Yamaguchi:
Falsification of Cyber-Physical Systems with Constrained Signal Spaces. NFM 2020: 420-439 - 2019
- [c12]Benoît Barbot, Nicolas Basset, Thao Dang:
Generation of Signals Under Temporal Constraints for CPS Testing. NFM 2019: 54-70 - [c11]Paolo Ballarini, Benoît Barbot, Nicolas Vasselin:
Performance modelling of access control mechanisms for local and vehicular wireless networks. VALUETOOLS 2019: 111-118 - 2018
- [c10]Benoît Barbot, Béatrice Bérard, Yann Duplouy, Serge Haddad:
Integrating Simulink Models into the Model Checker Cosmos. Petri Nets 2018: 363-373 - 2016
- [c9]Alban Linard, Benoît Barbot, Didier Buchs, Maximilien Colange, Clément Démoulins, Lom-Messan Hillah, Alexis Martin:
Layered Data: A Modular Formal Definition without Formalisms. PNSE @ Petri Nets 2016: 287-306 - [c8]Benoît Barbot, Marta Kwiatkowska, Alexandru Mereacre, Nicola Paoletti:
Building Power Consumption Models from Executable Timed I/O Automata Specifications. HSCC 2016: 195-204 - [c7]Benoît Barbot, Nicolas Basset, Marc Beunardeau, Marta Kwiatkowska:
Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement. QEST 2016: 175-190 - 2015
- [c6]Benoît Barbot, Marta Z. Kwiatkowska:
On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets. Petri Nets 2015: 1-32 - [c5]Benoît Barbot, Marta Z. Kwiatkowska, Alexandru Mereacre, Nicola Paoletti:
Estimation and Verification of Hybrid Heart Models for Personalised Medical and Wearable Devices. CMSB 2015: 3-7 - 2013
- [c4]Étienne André, Benoît Barbot, Clement Demoulins, Lom-Messan Hillah, Francis Hulin-Hubard, Fabrice Kordon, Alban Linard, Laure Petrucci:
A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. ICFEM 2013: 199-214 - [c3]Elvio Gilberto Amparore, Benoît Barbot, Marco Beccuti, Susanna Donatelli, Giuliana Franceschinis:
Simulation-based verification of hybrid automata stochastic logic formulas for stochastic symmetric nets. SIGSIM-PADS 2013: 253-264 - 2012
- [c2]Benoît Barbot, Serge Haddad, Claudine Picaronny:
Coupling and Importance Sampling for Statistical Model Checking. TACAS 2012: 331-346 - 2011
- [c1]Benoît Barbot, Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Efficient CTMC Model Checking of Linear Real-Time Objectives. TACAS 2011: 128-142
Editorship
- 2018
- [e1]Rena Bakhshi, Paolo Ballarini, Benoît Barbot, Hind Castel-Taleb, Anne Remke:
Computer Performance Engineering - 15th European Workshop, EPEW 2018, Paris, France, October 29-30, 2018, Proceedings. Lecture Notes in Computer Science 11178, Springer 2018, ISBN 978-3-030-02226-6 [contents]
Informal and Other Publications
- 2024
- [i5]Benoît Barbot, Damien Busatto-Gaston, Catalin Dima, Youssouf Oualhadj:
Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards. CoRR abs/2404.18584 (2024) - [i4]Benoît Barbot, Patricia Bouyer, Serge Haddad:
Beyond Decisiveness of Infinite Markov Chains. CoRR abs/2409.18670 (2024) - 2023
- [i3]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. CoRR abs/2306.08266 (2023) - 2020
- [i2]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification of Recurrent Neural Networks. CoRR abs/2009.10610 (2020) - 2019
- [i1]Paolo Ballarini, Benoît Barbot, Nicolas Vasselin:
Performance modelling of access control mechanisms for local and vehicular wireless networks. CoRR abs/1901.04285 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
