FAST: Fast Acceleration of Symbolikc Transition Systems. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Laure Petrucci (CAV, 2003)

Composition of Accelerations to Verify Infinite Heterogeneous Systems. - Sébastien Bardin; Alain Finkel (ATVA, 2004)

FASTer Acceleration of Counter Automata in Practice. - Sébastien Bardin; Alain Finkel; Jérôme Leroux (TACAS, 2004)

Flat Acceleration in Symbolic Model Checking. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Philippe Schnoebelen (ATVA, 2005)

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). - Sébastien Bardin (2005)

FAST Extended Release. - Sébastien Bardin; Jérôme Leroux; Gérald Point (CAV, 2006)

Structural Testing of Executables. - Sébastien Bardin; Philippe Herrmann (ICST, 2008)

FAST: acceleration from theory to practice. - Sébastien Bardin; Alain Finkel; Jérôme Leroux; Laure Petrucci (Int. J. Softw. Tools Technol. Transf., 2008)

Pruning the Search Space in Path-Based Test Generation. - Sébastien Bardin; Philippe Herrmann (ICST, 2009)

An Alternative to SAT-Based Approaches for Bit-Vectors. - Sébastien Bardin; Philippe Herrmann; Florian Perroud (TACAS, 2010)

The BINCOA Framework for Binary Code Analysis. - Sébastien Bardin; Philippe Herrmann; Jérôme Leroux; Olivier Ly; Renaud Tabary; Aymeric Vincent (CAV, 2011)

Refinement-Based CFG Reconstruction from Unstructured Programs. - Sébastien Bardin; Philippe Herrmann; Franck Védrine (VMCAI, 2011)

OSMOSE: automatic structural testing of executables. - Sébastien Bardin; Philippe Herrmann (Softw. Test. Verification Reliab., 2011)

fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. - Sébastien Bardin; Arnaud Gotlieb (CPAIOR, 2012)

Binary-Level Testing of Embedded Programs. - Sébastien Bardin; Philippe Baufreton; Nicolas Cornuet; Philippe Herrmann; Sébastien Labbé 002 (QSIC, 2013)

A Combined Approach for Constraints over Finite Domains and Arrays. - Sébastien Bardin; Arnaud Gotlieb (CoRR, 2013)

Efficient Leverage of Symbolic ATG Tools to Advanced Coverage Criteria. - Sébastien Bardin; Nikolai Kosmatov; François Cheynier (CoRR, 2013)

Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria. - Sébastien Bardin; Nikolai Kosmatov; François Cheynier (ICST, 2014)

An All-in-One Toolkit for Automated White-Box Testing. - Sébastien Bardin; Omar Chebaro; Mickaël Delahaye; Nikolai Kosmatov (TAP@STAF, 2014)

Sound and Quasi-Complete Detection of Infeasible Test Requirements. - Sébastien Bardin; Mickaël Delahaye; Robin David; Nikolai Kosmatov; Mike Papadakis; Yves Le Traon; Jean-Yves Marion (ICST, 2015)

BINSEC: Binary Code Analysis with Low-Level Regions. - Adel Djoudi; Sébastien Bardin (TACAS, 2015)

Finding the needle in the heap: combining static analysis and dynamic symbolic execution to trigger use-after-free. - Josselin Feist; Laurent Mounier; Sébastien Bardin; Robin David; Marie-Laure Potet (SSPREW@ACSAC, 2016)

Recovering High-Level Conditions from Binary Programs. - Adel Djoudi; Sébastien Bardin; Éric Goubault (FM, 2016)

Specification of concretization and symbolization policies in symbolic execution. - Robin David; Sébastien Bardin; Josselin Feist; Laurent Mounier; Marie-Laure Potet; Thanh Dinh Ta; Jean-Yves Marion (ISSTA, 2016)

BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis. - Robin David; Sébastien Bardin; Thanh Dinh Ta; Laurent Mounier; Josselin Feist; Marie-Laure Potet; Jean-Yves Marion (SANER, 2016)

Targeting Infeasibility Questions on Obfuscated Codes. - Robin David; Sébastien Bardin; Jean-Yves Marion (CoRR, 2016)

Sharpening Constraint Programming Approaches for Bit-Vector Theory. - Zakaria Chihani; Bruno Marre; François Bobot; Sébastien Bardin (CPAIOR, 2017)

Taming Coverage Criteria Heterogeneity with LTest. - Michaël Marcozzi; Sébastien Bardin; Mickaël Delahaye; Nikolai Kosmatov; Virgile Prevosto (ICST, 2017)

Generic and Effective Specification of Structural Test Objectives. - Michaël Marcozzi; Mickaël Delahaye; Sébastien Bardin; Nikolai Kosmatov; Virgile Prevosto (ICST, 2017)

Efficient and Complete FD-solving for extended array constraints. - Quentin Plazar; Mathieu Acher; Sébastien Bardin; Arnaud Gotlieb (IJCAI, 2017)

Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. - Sébastien Bardin; Robin David; Jean-Yves Marion (IEEE Symposium on Security and Privacy, 2017)

CDCL-inspired Word-level Learning for Bit-vector Constraint Solving. - Zakaria Chihani; François Bobot; Sébastien Bardin (CoRR, 2017)

Freeing Testers from Polluting Test Objectives. - Michaël Marcozzi; Sébastien Bardin; Nikolai Kosmatov; Mike Papadakis; Virgile Prevosto; Loïc Correnson (CoRR, 2017)

Abstract Interpretation using a Language of Symbolic Approximation. - Matthieu Lemerre; Sébastien Bardin (CoRR, 2017)

Model Generation for Quantified Formulas: A Taint-Based Approach. - Benjamin Farinier; Sébastien Bardin; Richard Bonichon; Marie-Laure Potet (CAV (2), 2018)

Symbolic Deobfuscation: From Virtualized Code Back to the Original. - Jonathan Salwan; Sébastien Bardin; Marie-Laure Potet (DIMVA, 2018)

Time to clean your test objectives. - Michaël Marcozzi; Sébastien Bardin; Nikolai Kosmatov; Mike Papadakis; Virgile Prevosto; Loïc Correnson (ICSE, 2018)

Test Case Generation with PathCrawler/LTest: How to Automate an Industrial Testing Process. - Sébastien Bardin; Nikolai Kosmatov; Bruno Marre; David Mentré; Nicky Williams (ISoLA (4), 2018)

Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. - Benjamin Farinier; Robin David; Sébastien Bardin; Matthieu Lemerre (LPAR, 2018)

How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). - Mathilde Ollivier; Sébastien Bardin; Richard Bonichon; Jean-Yves Marion (ACSAC, 2019)

Get Rid of Inline Assembly through Verification-Oriented Lifting. - Frédéric Recoules; Sébastien Bardin; Richard Bonichon; Laurent Mounier; Marie-Laure Potet (ASE, 2019)

Get rid of inline assembly through trustable verification-oriented lifting. - Frédéric Recoules; Sébastien Bardin; Richard Bonichon; Laurent Mounier; Marie-Laure Potet (CoRR, 2019)

Bringing CP, SAT and SMT together: Next Challenges in Constraint Solving (Dagstuhl Seminar 19062). - Sébastien Bardin; Nikolaj S. Bjørner; Cristian Cadar (Dagstuhl Reports, 2019)

Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. - Manh-Dung Nguyen; Sébastien Bardin; Richard Bonichon; Roland Groz; Matthieu Lemerre (RAID, 2020)

Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. - Lesly-Ann Daniel; Sébastien Bardin; Tamara Rezk (SP, 2020)

Toward certified quantum programming. - Christophe Chareton; Sébastien Bardin; François Bobot; Valentin Perrelle; Benoît Valiron (CoRR, 2020)

Automatically Proving Microkernels Free from Privilege Escalation from their Executable. - Olivier Nicole; Matthieu Lemerre; Sébastien Bardin; Xavier Rival (CoRR, 2020)

Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference. - Guillaume Girol; Benjamin Farinier; Sébastien Bardin (CAV (1), 2021)

Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate (Poster). - Grégoire Menguy; Sébastien Bardin; Richard Bonichon; Cauim de Souza Lima (CCS, 2021)

Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate. - Grégoire Menguy; Sébastien Bardin; Richard Bonichon; Cauim de Souza Lima (CCS, 2021)

An Automated Deductive Verification Framework for Circuit-building Quantum Programs. - Christophe Chareton; Sébastien Bardin; François Bobot; Valentin Perrelle; Benoît Valiron (ESOP, 2021)

A Tight Integration of Symbolic Execution and Fuzzing (Short Paper). - Yaëlle Vinçont; Sébastien Bardin; Michaël Marcozzi (FPS, 2021)

Evaluating Defensive Countermeasures for Software-Based Hardware Abstraction. - Jeffrey Todd McDonald; Ramya K. Manikyam; Sébastien Bardin; Richard Bonichon; Todd R. Andel; James Carambat (ICETE (Selected Papers), 2021)

Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine. - Frédéric Recoules; Sébastien Bardin; Richard Bonichon; Matthieu Lemerre; Laurent Mounier; Marie-Laure Potet (ICSE, 2021)

RUSTInA: Automatically Checking and Patching Inline Assembly Interface Compliance (Artifact Evaluation): Accepted submission #992 - "Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine". - Frédéric Recoules; Sébastien Bardin; Richard Bonichon; Matthieu Lemerre; Laurent Mounier; Marie-Laure Potet (ICSE (Companion Volume), 2021)

Hunting the Haunter - Efficient Relational Symbolic Execution for Spectre with Haunted RelSE. - Lesly-Ann Daniel; Sébastien Bardin; Tamara Rezk (NDSS, 2021)

No Crash, No Exploit: Automated Verification of Embedded Kernels. - Olivier Nicole; Matthieu Lemerre; Sébastien Bardin; Xavier Rival (RTAS, 2021)

Program Protection through Software-based Hardware Abstraction. - Jeffrey Todd McDonald; Ramya Manikyam; Sébastien Bardin; Richard Bonichon; Todd R. Andel (SECRYPT, 2021)

Binary level toolchain provenance identification with graph neural networks. - Tristan Benoit; Jean-Yves Marion; Sébastien Bardin (SANER, 2021)

AI-based Blackbox Code Deobfuscation: Understand, Improve and Mitigate. - Grégoire Menguy; Sébastien Bardin; Richard Bonichon; Cauim de Souza Lima (CoRR, 2021)

Formal Methods for Quantum Programs: A Survey. - Christophe Chareton; Sébastien Bardin; Dongho Lee; Benoît Valiron; Renaud Vilmart; Zhaowei Xu (CoRR, 2021)

Specify and measure, cover and reveal: A unified framework for automated test generation. - Sébastien Bardin; Nikolai Kosmatov; Michaël Marcozzi; Mickaël Delahaye (Sci. Comput. Program., 2021)

Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition. - Grégoire Menguy; Sébastien Bardin; Nadjib Lazaar; Arnaud Gotlieb (IJCAI, 2022)

A Quantitative Flavour of Robust Reachability. - Sébastien Bardin; Guillaume Girol (CoRR, 2022)

Machine Learning and Logical Reasoning: The New Frontier (Dagstuhl Seminar 22291). - Sébastien Bardin; Somesh Jha; Vijay Ganesh 001 (Dagstuhl Reports, 2022)

Formal Methods for Quantum Algorithms. - Christophe Chareton; Dongho Lee; Benoît Valiron; Renaud Vilmart; Sébastien Bardin; Zhaowei Xu (Handb. Formal Anal. Verification Cryptogr., 2023)

A Systematic Evaluation of Automated Tools for Side-Channel Vulnerabilities Detection in Cryptographic Libraries. - Antoine Geimer; Mathéo Vergnolle; Frédéric Recoules; Lesly-Ann Daniel; Sébastien Bardin; Clémentine Maurice (CCS, 2023)

Adversarial Reachability for Program-level Security Analysis. - Soline Ducousso; Sébastien Bardin; Marie-Laure Potet (ESOP, 2023)

Active Disjunctive Constraint Acquisition. - Grégoire Menguy; Sébastien Bardin; Nadjib Lazaar; Arnaud Gotlieb (KR, 2023)

Scalable Program Clone Search through Spectral Analysis. - Tristan Benoit; Jean-Yves Marion; Sébastien Bardin (ESEC/SIGSOFT FSE, 2023)

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy. - Lesly-Ann Daniel; Marton Bognar; Job Noorman; Sébastien Bardin; Tamara Rezk; Frank Piessens (USENIX Security Symposium, 2023)

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy (Extended version). - Lesly-Ann Daniel; Marton Bognar; Job Noorman; Sébastien Bardin; Tamara Rezk; Frank Piessens (CoRR, 2023)

Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure. - Lesly-Ann Daniel; Sébastien Bardin; Tamara Rezk (ACM Trans. Priv. Secur., 2023)

Trace Partitioning as an Optimization Problem. - M. Charles Babu; Matthieu Lemerre; Sébastien Bardin; Jean-Yves Marion (SAS, 2024)

Quantitative Robustness for Vulnerability Assessment. - Guillaume Girol; Guilhem Lacombe; Sébastien Bardin (Proc. ACM Program. Lang., 2024)

Inference of Robust Reachability Constraints. - Yanis Sellami; Guillaume Girol; Frédéric Recoules; Damien Couroussé; Sébastien Bardin (Proc. ACM Program. Lang., 2024)

Fine-grained Coverage-based Fuzzing. - Wei-Cheng Wu; Bernard Nongpoh; Marwan Nour; Michaël Marcozzi; Sébastien Bardin; Christophe Hauser (ACM Trans. Softw. Eng. Methodol., 2024)

Fine-grained Coverage-based Fuzzing - RCR Report. - Wei-Cheng Wu; Bernard Nongpoh; Marwan Nour; Michaël Marcozzi; Sébastien Bardin; Christophe Hauser (ACM Trans. Softw. Eng. Methodol., 2024)

Introducing robust reachability. - Guillaume Girol; Benjamin Farinier; Sébastien Bardin (Formal Methods Syst. Des., 2024)

Exploring the Potential of LLMs for Code Deobfuscation. - David Beste; Grégoire Menguy; Hossein Hajipour; Mario Fritz; Antonio Emanuele Cinà; Sébastien Bardin; Thorsten Holz; Thorsten Eisenhofer; Lea Schönherr (DIMVA (1), 2025)

A Query-Based Constraint Acquisition Approach for Enhanced Precision in Program Precondition Inference. - Grégoire Menguy; Sébastien Bardin; Arnaud Gotlieb; Nadjib Lazaar (J. Artif. Intell. Res., 2025)

Attacker Control and Bug Prioritization. - Guilhem Lacombe; Sébastien Bardin (CoRR, 2025)