| 2025 | CCS | Augmenting Search-based Program Synthesis with Local Inference Rules to Improve Black-box Deobfuscation. | Vidal Attias, Nicolas Bellec, Grgoire Menguy, Sbastien Bardin, Jean-Yves Marion |
| 2025 | CCS | CheckMATE '25: Research on Offensive and Defensive Techniques in the Context of Man At The End (MATE) Attacks. | Sbastien Bardin, Michele Ianni, Hyungon Moon |
| 2025 | DIMVA | Exploring the Potential of LLMs for Code Deobfuscation. | David Beste, Grgoire Menguy, Hossein Hajipour, Mario Fritz, Antonio Emanuele Cin, Sbastien Bardin, Thorsten Holz, Thorsten Eisenhofer, Lea Schnherr |
| 2024 | SAS | Trace Partitioning as an Optimization Problem. | M. Charles Babu, Matthieu Lemerre, Sbastien Bardin, Jean-Yves Marion |
| 2023 | CCS | A Systematic Evaluation of Automated Tools for Side-Channel Vulnerabilities Detection in Cryptographic Libraries. | Antoine Geimer, Matho Vergnolle, Frdric Recoules, Lesly-Ann Daniel, Sbastien Bardin, Clmentine Maurice |
| 2023 | ESOP | Adversarial Reachability for Program-level Security Analysis. | Soline Ducousso, Sbastien Bardin, Marie-Laure Potet |
| 2023 | KR | Active Disjunctive Constraint Acquisition. | Grgoire Menguy, Sbastien Bardin, Nadjib Lazaar, Arnaud Gotlieb |
| 2022 | IJCAI | Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition. | Grgoire Menguy, Sbastien Bardin, Nadjib Lazaar, Arnaud Gotlieb |
| 2021 | CAV | Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference. | Guillaume Girol, Benjamin Farinier, Sbastien Bardin |
| 2021 | CCS | Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate (Poster). | Grgoire Menguy, Sbastien Bardin, Richard Bonichon, Cauim de Souza Lima |
| 2021 | CCS | Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate. | Grgoire Menguy, Sbastien Bardin, Richard Bonichon, Cauim de Souza Lima |
| 2021 | ESOP | An Automated Deductive Verification Framework for Circuit-building Quantum Programs. | Christophe Chareton, Sbastien Bardin, Franois Bobot, Valentin Perrelle, Benot Valiron |
| 2021 | ICSE | Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine. | Frdric Recoules, Sbastien Bardin, Richard Bonichon, Matthieu Lemerre, Laurent Mounier, Marie-Laure Potet |
| 2021 | ICSE | RUSTInA: Automatically Checking and Patching Inline Assembly Interface Compliance (Artifact Evaluation): Accepted submission #992 - "Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine". | Frdric Recoules, Sbastien Bardin, Richard Bonichon, Matthieu Lemerre, Laurent Mounier, Marie-Laure Potet |
| 2021 | NDSS | Hunting the Haunter - Efficient Relational Symbolic Execution for Spectre with Haunted RelSE. | Lesly-Ann Daniel, Sbastien Bardin, Tamara Rezk |
| 2021 | RTAS | No Crash, No Exploit: Automated Verification of Embedded Kernels. | Olivier Nicole, Matthieu Lemerre, Sbastien Bardin, Xavier Rival |
| 2021 | SECRYPT | Program Protection through Software-based Hardware Abstraction. | Jeffrey Todd McDonald, Ramya Manikyam, Sbastien Bardin, Richard Bonichon, Todd R. Andel |
| 2020 | RAID | Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities. | Manh-Dung Nguyen, Sbastien Bardin, Richard Bonichon, Roland Groz, Matthieu Lemerre |
| 2020 | SP | Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level. | Lesly-Ann Daniel, Sbastien Bardin, Tamara Rezk |
| 2019 | ACSAC | How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). | Mathilde Ollivier, Sbastien Bardin, Richard Bonichon, Jean-Yves Marion |
| 2018 | CAV | Model Generation for Quantified Formulas: A Taint-Based Approach. | Benjamin Farinier, Sbastien Bardin, Richard Bonichon, Marie-Laure Potet |
| 2018 | DIMVA | Symbolic Deobfuscation: From Virtualized Code Back to the Original. | Jonathan Salwan, Sbastien Bardin, Marie-Laure Potet |
| 2018 | ICSE | Time to clean your test objectives. | Michal Marcozzi, Sbastien Bardin, Nikolai Kosmatov, Mike Papadakis, Virgile Prevosto, Loc Correnson |
| 2018 | ISoLA | Test Case Generation with PathCrawler/LTest: How to Automate an Industrial Testing Process. | Sbastien Bardin, Nikolai Kosmatov, Bruno Marre, David Mentr, Nicky Williams |
| 2018 | LPAR | Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. | Benjamin Farinier, Robin David, Sbastien Bardin, Matthieu Lemerre |
| 2017 | CPAIOR | Sharpening Constraint Programming Approaches for Bit-Vector Theory. | Zakaria Chihani, Bruno Marre, Franois Bobot, Sbastien Bardin |
| 2017 | IJCAI | Efficient and Complete FD-solving for extended array constraints. | Quentin Plazar, Mathieu Acher, Sbastien Bardin, Arnaud Gotlieb |
| 2017 | ICST | Taming Coverage Criteria Heterogeneity with LTest. | Michal Marcozzi, Sbastien Bardin, Mickal Delahaye, Nikolai Kosmatov, Virgile Prevosto |
| 2017 | ICST | Generic and Effective Specification of Structural Test Objectives. | Michal Marcozzi, Mickal Delahaye, Sbastien Bardin, Nikolai Kosmatov, Virgile Prevosto |
| 2017 | SP | Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. | Sbastien Bardin, Robin David, Jean-Yves Marion |
| 2016 | ACSAC | Finding the needle in the heap: combining static analysis and dynamic symbolic execution to trigger use-after-free. | Josselin Feist, Laurent Mounier, Sbastien Bardin, Robin David, Marie-Laure Potet |
| 2016 | FM | Recovering High-Level Conditions from Binary Programs. | Adel Djoudi, Sbastien Bardin, ric Goubault |
| 2016 | ISSTA | Specification of concretization and symbolization policies in symbolic execution. | Robin David, Sbastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion |
| 2015 | ICST | Sound and Quasi-Complete Detection of Infeasible Test Requirements. | Sbastien Bardin, Mickal Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion |
| 2015 | TACAS | BINSEC: Binary Code Analysis with Low-Level Regions. | Adel Djoudi, Sbastien Bardin |
| 2014 | ICST | Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria. | Sbastien Bardin, Nikolai Kosmatov, Franois Cheynier |
| 2014 | TAP | An All-in-One Toolkit for Automated White-Box Testing. | Sbastien Bardin, Omar Chebaro, Mickal Delahaye, Nikolai Kosmatov |
| 2012 | CPAIOR | fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays. | Sbastien Bardin, Arnaud Gotlieb |
| 2011 | CAV | The BINCOA Framework for Binary Code Analysis. | Sbastien Bardin, Philippe Herrmann, Jrme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent |
| 2011 | VMCAI | Refinement-Based CFG Reconstruction from Unstructured Programs. | Sbastien Bardin, Philippe Herrmann, Franck Vdrine |
| 2010 | TACAS | An Alternative to SAT-Based Approaches for Bit-Vectors. | Sbastien Bardin, Philippe Herrmann, Florian Perroud |
| 2009 | ICST | Pruning the Search Space in Path-Based Test Generation. | Sbastien Bardin, Philippe Herrmann |
| 2008 | ICST | Structural Testing of Executables. | Sbastien Bardin, Philippe Herrmann |
| 2006 | CAV | FAST Extended Release. | Sbastien Bardin, Jrme Leroux, Grald Point |
| 2005 | ATVA | Flat Acceleration in Symbolic Model Checking. | Sbastien Bardin, Alain Finkel, Jrme Leroux, Philippe Schnoebelen |
| 2004 | ATVA | Composition of Accelerations to Verify Infinite Heterogeneous Systems. | Sbastien Bardin, Alain Finkel |
| 2004 | TACAS | FASTer Acceleration of Counter Automata in Practice. | Sbastien Bardin, Alain Finkel, Jrme Leroux |
| 2003 | CAV | FAST: Fast Acceleration of Symbolikc Transition Systems. | Sbastien Bardin, Alain Finkel, Jrme Leroux, Laure Petrucci |