default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Bardin
Person information
- affiliation: Université Paris-Saclay, CEA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j9]Guillaume Girol, Benjamin Farinier, Sébastien Bardin:
Introducing robust reachability. Formal Methods Syst. Des. 63(1): 206-234 (2024)- [j8]Guillaume Girol
, Guilhem Lacombe, Sébastien Bardin:
Quantitative Robustness for Vulnerability Assessment. Proc. ACM Program. Lang. 8(PLDI): 741-765 (2024) - [j7]Yanis Sellami, Guillaume Girol, Frédéric Recoules, Damien Couroussé, Sébastien Bardin:
Inference of Robust Reachability Constraints. Proc. ACM Program. Lang. 8(POPL): 2731-2760 (2024) - [j6]Wei-Cheng Wu, Bernard Nongpoh, Marwan Nour, Michaël Marcozzi, Sébastien Bardin, Christophe Hauser:
Fine-grained Coverage-based Fuzzing. ACM Trans. Softw. Eng. Methodol. 33(5): 138:1-138:41 (2024) - [j5]Wei-Cheng Wu, Bernard Nongpoh, Marwan Nour, Michaël Marcozzi, Sébastien Bardin, Christophe Hauser:
Fine-grained Coverage-based Fuzzing - RCR Report. ACM Trans. Softw. Eng. Methodol. 33(5): 139:1-139:4 (2024) - 2023
- [j4]Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk:
Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure. ACM Trans. Priv. Secur. 26(2): 11:1-11:42 (2023) - [c52]Antoine Geimer, Mathéo Vergnolle, Frédéric Recoules, Lesly-Ann Daniel, Sébastien Bardin, Clémentine Maurice:
A Systematic Evaluation of Automated Tools for Side-Channel Vulnerabilities Detection in Cryptographic Libraries. CCS 2023: 1690-1704 - [c51]Soline Ducousso, Sébastien Bardin, Marie-Laure Potet:
Adversarial Reachability for Program-level Security Analysis. ESOP 2023: 59-89 - [c50]Grégoire Menguy, Sébastien Bardin, Nadjib Lazaar, Arnaud Gotlieb:
Active Disjunctive Constraint Acquisition. KR 2023: 512-520 - [c49]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Scalable Program Clone Search through Spectral Analysis. ESEC/SIGSOFT FSE 2023: 808-820 - [c48]Lesly-Ann Daniel, Marton Bognar, Job Noorman, Sébastien Bardin, Tamara Rezk, Frank Piessens:
ProSpeCT: Provably Secure Speculation for the Constant-Time Policy. USENIX Security Symposium 2023: 7161-7178 - [p1]Christophe Chareton, Dongho Lee, Benoît Valiron, Renaud Vilmart, Sébastien Bardin, Zhaowei Xu:
Formal Methods for Quantum Algorithms. Handb. Formal Anal. Verification Cryptogr. 2023: 319-422 - [i25]Lesly-Ann Daniel, Marton Bognar, Job Noorman, Sébastien Bardin, Tamara Rezk, Frank Piessens:
ProSpeCT: Provably Secure Speculation for the Constant-Time Policy (Extended version). CoRR abs/2302.12108 (2023) - [i24]Antoine Geimer, Mathéo Vergnolle, Frédéric Recoules, Lesly-Ann Daniel, Sébastien Bardin, Clémentine Maurice:
A Systematic Evaluation of Automated Tools for Side-Channel Vulnerabilities Detection in Cryptographic Libraries. CoRR abs/2310.08153 (2023) - 2022
- [c47]Grégoire Menguy, Sébastien Bardin, Nadjib Lazaar, Arnaud Gotlieb:
Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition. IJCAI 2022: 1873-1879 - [i23]Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk:
Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure. CoRR abs/2209.01129 (2022) - [i22]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Scalable Program Clone Search Through Spectral Analysis. CoRR abs/2210.13063 (2022) - [i21]Sébastien Bardin, Guillaume Girol:
A Quantitative Flavour of Robust Reachability. CoRR abs/2212.05244 (2022) - [i20]Sébastien Bardin, Somesh Jha, Vijay Ganesh:
Machine Learning and Logical Reasoning: The New Frontier (Dagstuhl Seminar 22291). Dagstuhl Reports 12(7): 80-111 (2022) - 2021
- [j3]Sébastien Bardin, Nikolai Kosmatov, Michaël Marcozzi, Mickaël Delahaye:
Specify and measure, cover and reveal: A unified framework for automated test generation. Sci. Comput. Program. 207: 102641 (2021) - [c46]Guillaume Girol, Benjamin Farinier, Sébastien Bardin:
Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference. CAV (1) 2021: 669-693 - [c45]Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de Souza Lima:
Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate (Poster). CCS 2021: 2384-2386 - [c44]Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de Souza Lima:
Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate. CCS 2021: 2513-2525 - [c43]Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron:
An Automated Deductive Verification Framework for Circuit-building Quantum Programs. ESOP 2021: 148-177 - [c42]Yaëlle Vinçont, Sébastien Bardin, Michaël Marcozzi:
A Tight Integration of Symbolic Execution and Fuzzing (Short Paper). FPS 2021: 303-310 - [c41]Jeffrey Todd McDonald, Ramya K. Manikyam, Sébastien Bardin, Richard Bonichon, Todd R. Andel, James Carambat:
Evaluating Defensive Countermeasures for Software-Based Hardware Abstraction. ICETE (Selected Papers) 2021: 281-304 - [c40]Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Matthieu Lemerre, Laurent Mounier, Marie-Laure Potet:
RUSTInA: Automatically Checking and Patching Inline Assembly Interface Compliance (Artifact Evaluation): Accepted submission #992 - "Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine". ICSE (Companion Volume) 2021: 201-202 - [c39]Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Matthieu Lemerre, Laurent Mounier, Marie-Laure Potet:
Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine. ICSE 2021: 1236-1247 - [c38]Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk:
Hunting the Haunter - Efficient Relational Symbolic Execution for Spectre with Haunted RelSE. NDSS 2021 - [c37]Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival:
No Crash, No Exploit: Automated Verification of Embedded Kernels. RTAS 2021: 27-39 - [c36]Jeffrey Todd McDonald, Ramya Manikyam, Sébastien Bardin, Richard Bonichon, Todd R. Andel:
Program Protection through Software-based Hardware Abstraction. SECRYPT 2021: 247-258 - [c35]Tristan Benoit, Jean-Yves Marion, Sébastien Bardin:
Binary level toolchain provenance identification with graph neural networks. SANER 2021: 131-141 - [i19]Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de Souza Lima:
AI-based Blackbox Code Deobfuscation: Understand, Improve and Mitigate. CoRR abs/2102.04805 (2021) - [i18]Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Matthieu Lemerre, Laurent Mounier, Marie-Laure Potet:
Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine. CoRR abs/2102.07485 (2021) - [i17]Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, Zhaowei Xu:
Formal Methods for Quantum Programs: A Survey. CoRR abs/2109.06493 (2021) - 2020
- [c34]Manh-Dung Nguyen, Sébastien Bardin, Richard Bonichon, Roland Groz, Matthieu Lemerre:
Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. RAID 2020: 47-62 - [c33]Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk:
Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. SP 2020: 1021-1038 - [i16]Manh-Dung Nguyen, Sébastien Bardin, Richard Bonichon, Roland Groz, Matthieu Lemerre:
Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. CoRR abs/2002.10751 (2020) - [i15]Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron:
Toward certified quantum programming. CoRR abs/2003.05841 (2020) - [i14]Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival:
Automatically Proving Microkernels Free from Privilege Escalation from their Executable. CoRR abs/2003.08915 (2020) - [i13]Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival:
No Crash, No Exploit: Automated Verification of Embedded Kernels. CoRR abs/2011.15065 (2020)
2010 – 2019
- 2019
- [c32]Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion:
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). ACSAC 2019: 177-189 - [c31]Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Laurent Mounier, Marie-Laure Potet:
Get Rid of Inline Assembly through Verification-Oriented Lifting. ASE 2019: 577-589 - [i12]Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Laurent Mounier, Marie-Laure Potet:
Get rid of inline assembly through trustable verification-oriented lifting. CoRR abs/1903.06407 (2019) - [i11]Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion:
How to Kill Symbolic Deobfuscation for Free; or Unleashing the Potential of Path-Oriented Protections. CoRR abs/1908.01549 (2019) - [i10]Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk:
Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. CoRR abs/1912.08788 (2019) - [i9]Sébastien Bardin, Nikolaj S. Bjørner, Cristian Cadar:
Bringing CP, SAT and SMT together: Next Challenges in Constraint Solving (Dagstuhl Seminar 19062). Dagstuhl Reports 9(2): 27-47 (2019) - 2018
- [c30]Benjamin Farinier, Sébastien Bardin, Richard Bonichon, Marie-Laure Potet:
Model Generation for Quantified Formulas: A Taint-Based Approach. CAV (2) 2018: 294-313 - [c29]Jonathan Salwan, Sébastien Bardin, Marie-Laure Potet:
Symbolic Deobfuscation: From Virtualized Code Back to the Original. DIMVA 2018: 372-392 - [c28]Michaël Marcozzi, Sébastien Bardin, Nikolai Kosmatov, Mike Papadakis, Virgile Prevosto, Loïc Correnson:
Time to clean your test objectives. ICSE 2018: 456-467 - [c27]Sébastien Bardin, Nikolai Kosmatov, Bruno Marre, David Mentré, Nicky Williams:
Test Case Generation with PathCrawler/LTest: How to Automate an Industrial Testing Process. ISoLA (4) 2018: 104-120 - [c26]Benjamin Farinier, Robin David, Sébastien Bardin, Matthieu Lemerre:
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. LPAR 2018: 363-380 - [e2]Jeffrey Todd McDonald, Sébastien Bardin, Natalia Stakhanova:
Proceedings of the 8th Software Security, Protection, and Reverse Engineering Workshop, San Juan, PR, USA, December 3-4, 2018. ACM 2018, ISBN 978-1-4503-6096-8 [contents] - [e1]Cristiano Giuffrida, Sébastien Bardin, Gregory Blanc:
Detection of Intrusions and Malware, and Vulnerability Assessment - 15th International Conference, DIMVA 2018, Saclay, France, June 28-29, 2018, Proceedings. Lecture Notes in Computer Science 10885, Springer 2018, ISBN 978-3-319-93410-5 [contents] - [i8]Benjamin Farinier, Sébastien Bardin, Richard Bonichon, Marie-Laure Potet:
Model Generation for Quantified Formulas: A Taint-Based Approach. CoRR abs/1802.05616 (2018) - 2017
- [c25]Zakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin:
Sharpening Constraint Programming Approaches for Bit-Vector Theory. CPAIOR 2017: 3-20 - [c24]Michaël Marcozzi, Mickaël Delahaye, Sébastien Bardin, Nikolai Kosmatov, Virgile Prevosto:
Generic and Effective Specification of Structural Test Objectives. ICST 2017: 436-441 - [c23]Michaël Marcozzi, Sébastien Bardin, Mickaël Delahaye, Nikolai Kosmatov, Virgile Prevosto:
Taming Coverage Criteria Heterogeneity with LTest. ICST 2017: 500-507 - [c22]Quentin Plazar, Mathieu Acher, Sébastien Bardin, Arnaud Gotlieb:
Efficient and Complete FD-solving for extended array constraints. IJCAI 2017: 1231-1238 - [c21]Sébastien Bardin, Robin David, Jean-Yves Marion:
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. IEEE Symposium on Security and Privacy 2017: 633-651 - [i7]Zakaria Chihani, François Bobot, Sébastien Bardin:
CDCL-inspired Word-level Learning for Bit-vector Constraint Solving. CoRR abs/1706.09229 (2017) - [i6]Michaël Marcozzi, Sébastien Bardin, Nikolai Kosmatov, Mike Papadakis, Virgile Prevosto, Loïc Correnson:
Freeing Testers from Polluting Test Objectives. CoRR abs/1708.08765 (2017) - [i5]Matthieu Lemerre, Sébastien Bardin:
Abstract Interpretation using a Language of Symbolic Approximation. CoRR abs/1712.10058 (2017) - 2016
- [c20]Josselin Feist, Laurent Mounier, Sébastien Bardin, Robin David, Marie-Laure Potet:
Finding the needle in the heap: combining static analysis and dynamic symbolic execution to trigger use-after-free. SSPREW@ACSAC 2016: 2:1-2:12 - [c19]Adel Djoudi, Sébastien Bardin, Éric Goubault:
Recovering High-Level Conditions from Binary Programs. FM 2016: 235-253 - [c18]Robin David, Sébastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion:
Specification of concretization and symbolization policies in symbolic execution. ISSTA 2016: 36-46 - [c17]Robin David, Sébastien Bardin, Thanh Dinh Ta, Laurent Mounier, Josselin Feist, Marie-Laure Potet, Jean-Yves Marion:
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis. SANER 2016: 653-656 - [i4]Sébastien Bardin, Mickaël Delahaye, Nikolai Kosmatov, Michaël Marcozzi, Virgile Prevosto:
Generic and Effective Specification of Structural Test Objectives. CoRR abs/1609.01204 (2016) - [i3]Robin David, Sébastien Bardin, Jean-Yves Marion:
Targeting Infeasibility Questions on Obfuscated Codes. CoRR abs/1612.05675 (2016) - 2015
- [c16]Sébastien Bardin, Mickaël Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion:
Sound and Quasi-Complete Detection of Infeasible Test Requirements. ICST 2015: 1-10 - [c15]Adel Djoudi, Sébastien Bardin:
BINSEC: Binary Code Analysis with Low-Level Regions. TACAS 2015: 212-217 - 2014
- [c14]Sébastien Bardin, Nikolai Kosmatov, François Cheynier:
Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria. ICST 2014: 173-182 - [c13]Sébastien Bardin, Omar Chebaro, Mickaël Delahaye, Nikolai Kosmatov:
An All-in-One Toolkit for Automated White-Box Testing. TAP@STAF 2014: 53-60 - 2013
- [c12]Sébastien Bardin, Philippe Baufreton, Nicolas Cornuet, Philippe Herrmann, Sébastien Labbé:
Binary-Level Testing of Embedded Programs. QSIC 2013: 11-20 - [i2]Sébastien Bardin, Nikolai Kosmatov, François Cheynier:
Efficient Leverage of Symbolic ATG Tools to Advanced Coverage Criteria. CoRR abs/1308.4045 (2013) - [i1]Sébastien Bardin, Arnaud Gotlieb:
A Combined Approach for Constraints over Finite Domains and Arrays. CoRR abs/1312.0200 (2013) - 2012
- [c11]Sébastien Bardin, Arnaud Gotlieb:
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. CPAIOR 2012: 17-33 - 2011
- [j2]Sébastien Bardin, Philippe Herrmann:
OSMOSE: automatic structural testing of executables. Softw. Test. Verification Reliab. 21(1): 29-54 (2011) - [c10]Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent:
The BINCOA Framework for Binary Code Analysis. CAV 2011: 165-170 - [c9]Sébastien Bardin, Philippe Herrmann, Franck Védrine:
Refinement-Based CFG Reconstruction from Unstructured Programs. VMCAI 2011: 54-69 - 2010
- [c8]Sébastien Bardin, Philippe Herrmann, Florian Perroud:
An Alternative to SAT-Based Approaches for Bit-Vectors. TACAS 2010: 84-98
2000 – 2009
- 2009
- [c7]Sébastien Bardin, Philippe Herrmann:
Pruning the Search Space in Path-Based Test Generation. ICST 2009: 240-249 - 2008
- [j1]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10(5): 401-424 (2008) - [c6]Sébastien Bardin, Philippe Herrmann:
Structural Testing of Executables. ICST 2008: 22-31 - 2006
- [c5]Sébastien Bardin, Jérôme Leroux, Gérald Point:
FAST Extended Release. CAV 2006: 63-66 - 2005
- [b1]Sébastien Bardin:
Vers un Model Checking avec accélération plate des systèmes hétérogènes. (Toward a Model Checking with Flat Acceleration of Heterogeneous Systems). École normale supérieure de Cachan, France, 2005 - [c4]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen:
Flat Acceleration in Symbolic Model Checking. ATVA 2005: 474-488 - 2004
- [c3]Sébastien Bardin, Alain Finkel:
Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA 2004: 248-262 - [c2]Sébastien Bardin, Alain Finkel, Jérôme Leroux:
FASTer Acceleration of Counter Automata in Practice. TACAS 2004: 576-590 - 2003
- [c1]Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci:
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV 2003: 118-121
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:10 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:
