Sébastien Bardin

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 65

Top Venues

École normale supérieure de Cachan, France (PHD)

Education History

École normale supérieure de Cachan, France

PHD

Publications

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) (2024)
Guillaume Girol, Guilhem Lacombe, Sébastien Bardin
Quantitative Robustness for Vulnerability Assessment. Proc. ACM Program. Lang. 8 (PLDI) (2024)
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) (2024)
Yanis Sellami, Guillaume Girol, Frédéric Recoules, Damien Couroussé, Sébastien Bardin
Inference of Robust Reachability Constraints. Proc. ACM Program. Lang. 8 (POPL) (2024)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Scalable Program Clone Search through Spectral Analysis. ESEC/SIGSOFT FSE (2023)
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)
Grégoire Menguy, Sébastien Bardin, Nadjib Lazaar, Arnaud Gotlieb
Active Disjunctive Constraint Acquisition. KR (2023)
Soline Ducousso, Sébastien Bardin, Marie-Laure Potet
Adversarial Reachability for Program-level Security Analysis. ESOP (2023)
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)
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 (2023)
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 (2023)
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) (2023)
Grégoire Menguy, Sébastien Bardin, Nadjib Lazaar, Arnaud Gotlieb
Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition. IJCAI (2022)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Scalable Program Clone Search Through Spectral Analysis. CoRR (2022)
Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk
Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure. CoRR (2022)
Sébastien Bardin, Guillaume Girol
A Quantitative Flavour of Robust Reachability. CoRR (2022)
Sébastien Bardin, Somesh Jha, Vijay Ganesh
Machine Learning and Logical Reasoning: The New Frontier (Dagstuhl Seminar 22291). Dagstuhl Reports 12 (7) (2022)
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)
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)
Guillaume Girol, Benjamin Farinier, Sébastien Bardin
Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference. CAV (1) (2021)
Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, Zhaowei Xu
Formal Methods for Quantum Programs: A Survey. CoRR (2021)
Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival
No Crash, No Exploit: Automated Verification of Embedded Kernels. RTAS (2021)
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)
Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk
Hunting the Haunter - Efficient Relational Symbolic Execution for Spectre with Haunted RelSE. NDSS (2021)
Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de Souza Lima
AI-based Blackbox Code Deobfuscation: Understand, Improve and Mitigate. CoRR (2021)
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)
Jeffrey Todd McDonald, Ramya Manikyam, Sébastien Bardin, Richard Bonichon, Todd R. Andel
Program Protection through Software-based Hardware Abstraction. SECRYPT (2021)
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 (2021)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Binary level toolchain provenance identification with graph neural networks. SANER (2021)
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)
Yaëlle Vinçont, Sébastien Bardin, Michaël Marcozzi
A Tight Integration of Symbolic Execution and Fuzzing (Short Paper). FPS (2021)
Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de Souza Lima
Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate. CCS (2021)
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 (2021)
Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk
Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. IEEE Symposium on Security and Privacy (2020)
Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron
Toward certified quantum programming. CoRR (2020)
Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival
No Crash, No Exploit: Automated Verification of Embedded Kernels. CoRR (2020)
Manh-Dung Nguyen, Sébastien Bardin, Richard Bonichon, Roland Groz, Matthieu Lemerre
Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. RAID (2020)
Olivier Nicole, Matthieu Lemerre, Sébastien Bardin, Xavier Rival
Automatically Proving Microkernels Free from Privilege Escalation from their Executable. CoRR (2020)
Manh-Dung Nguyen, Sébastien Bardin, Richard Bonichon, Roland Groz, Matthieu Lemerre
Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. CoRR (2020)
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 (2019)
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 (2019)
Lesly-Ann Daniel, Sébastien Bardin, Tamara Rezk
Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. CoRR (2019)
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)
Sébastien Bardin, Nikolaj Bjørner, Cristian Cadar
Bringing CP, SAT and SMT together: Next Challenges in Constraint Solving (Dagstuhl Seminar 19062). Dagstuhl Reports 9 (2) (2019)
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)
Benjamin Farinier, Sébastien Bardin, Richard Bonichon, Marie-Laure Potet
Model Generation for Quantified Formulas: A Taint-Based Approach. CoRR (2018)
Benjamin Farinier, Robin David, Sébastien Bardin, Matthieu Lemerre
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. LPAR (2018)
Michaël Marcozzi, Sébastien Bardin, Nikolai Kosmatov, Mike Papadakis, Virgile Prevosto, Loïc Correnson
Time to clean your test objectives. ICSE (2018)
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)
Benjamin Farinier, Sébastien Bardin, Richard Bonichon, Marie-Laure Potet
Model Generation for Quantified Formulas: A Taint-Based Approach. CAV (2) (2018)
Jonathan Salwan, Sébastien Bardin, Marie-Laure Potet
Symbolic Deobfuscation: From Virtualized Code Back to the Original. DIMVA (2018)
Michaël Marcozzi, Sébastien Bardin, Nikolai Kosmatov, Mike Papadakis, Virgile Prevosto, Loïc Correnson
Freeing Testers from Polluting Test Objectives. CoRR (2017)
Zakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin
Sharpening Constraint Programming Approaches for Bit-Vector Theory. CPAIOR (2017)
Quentin Plazar, Mathieu Acher, Sébastien Bardin, Arnaud Gotlieb
Efficient and Complete FD-solving for extended array constraints. IJCAI (2017)
Sébastien Bardin, Robin David, Jean-Yves Marion
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. IEEE Symposium on Security and Privacy (2017)
Matthieu Lemerre, Sébastien Bardin
Abstract Interpretation using a Language of Symbolic Approximation. CoRR (2017)
Michaël Marcozzi, Sébastien Bardin, Mickaël Delahaye, Nikolai Kosmatov, Virgile Prevosto
Taming Coverage Criteria Heterogeneity with LTest. ICST (2017)
Michaël Marcozzi, Mickaël Delahaye, Sébastien Bardin, Nikolai Kosmatov, Virgile Prevosto
Generic and Effective Specification of Structural Test Objectives. ICST (2017)
Zakaria Chihani, François Bobot, Sébastien Bardin
CDCL-inspired Word-level Learning for Bit-vector Constraint Solving. CoRR (2017)
Sébastien Bardin, Mickaël Delahaye, Nikolai Kosmatov, Michaël Marcozzi, Virgile Prevosto
Generic and Effective Specification of Structural Test Objectives. CoRR (2016)
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)
Robin David, Sébastien Bardin, Jean-Yves Marion
Targeting Infeasibility Questions on Obfuscated Codes. CoRR (2016)
Adel Djoudi, Sébastien Bardin, Éric Goubault
Recovering High-Level Conditions from Binary Programs. FM (2016)
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)
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)
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)
Adel Djoudi, Sébastien Bardin
BINSEC: Binary Code Analysis with Low-Level Regions. TACAS (2015)
Sébastien Bardin, Omar Chebaro, Mickaël Delahaye, Nikolai Kosmatov
An All-in-One Toolkit for Automated White-Box Testing. TAP@STAF (2014)
Sébastien Bardin, Nikolai Kosmatov, François Cheynier
Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria. ICST (2014)
Sébastien Bardin, Nikolai Kosmatov, François Cheynier
Efficient Leverage of Symbolic ATG Tools to Advanced Coverage Criteria. CoRR (2013)
Sébastien Bardin, Philippe Baufreton, Nicolas Cornuet, Philippe Herrmann, Sébastien Labbé
Binary-Level Testing of Embedded Programs. QSIC (2013)
Sébastien Bardin, Arnaud Gotlieb
A Combined Approach for Constraints over Finite Domains and Arrays. CoRR (2013)
Sébastien Bardin, Arnaud Gotlieb
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. CPAIOR (2012)
Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent
The BINCOA Framework for Binary Code Analysis. CAV (2011)
Sébastien Bardin, Philippe Herrmann, Franck Védrine
Refinement-Based CFG Reconstruction from Unstructured Programs. VMCAI (2011)
Sébastien Bardin, Philippe Herrmann
OSMOSE: automatic structural testing of executables. Softw. Test. Verification Reliab. 21 (1) (2011)
Sébastien Bardin, Philippe Herrmann, Florian Perroud
An Alternative to SAT-Based Approaches for Bit-Vectors. TACAS (2010)
Sébastien Bardin, Philippe Herrmann
Pruning the Search Space in Path-Based Test Generation. ICST (2009)
Sébastien Bardin, Philippe Herrmann
Structural Testing of Executables. ICST (2008)
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) (2008)
Sébastien Bardin, Jérôme Leroux, Gérald Point
FAST Extended Release. CAV (2006)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Philippe Schnoebelen
Flat Acceleration in Symbolic Model Checking. ATVA (2005)
Sébastien Bardin, Alain Finkel, Jérôme Leroux
FASTer Acceleration of Counter Automata in Practice. TACAS (2004)
Sébastien Bardin, Alain Finkel
Composition of Accelerations to Verify Infinite Heterogeneous Systems. ATVA (2004)
Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
FAST: Fast Acceleration of Symbolikc Transition Systems. CAV (2003)

Sébastien Bardin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sébastien Bardin