[go: up one dir, main page]

Follow
Sébastien Bardin
Sébastien Bardin
CEA, List, Université Paris-Saclay
Verified email at cea.fr - Homepage
Title
Cited by
Cited by
Year
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
International Conference on Computer Aided Verification, 118-121, 2003
1712003
Binary-level directed fuzzing for {use-after-free} vulnerabilities
MD Nguyen, S Bardin, R Bonichon, R Groz, M Lemerre
23rd International Symposium on Research in Attacks, Intrusions and Defenses …, 2020
1342020
BINSEC/SE: A dynamic symbolic execution toolkit for binary-level analysis
R David, S Bardin, TD Ta, L Mounier, J Feist, ML Potet, JY Marion
2016 IEEE 23rd International Conference on Software Analysis, Evolution, and …, 2016
1312016
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
International symposium on automated technology for verification and …, 2005
1162005
An automated deductive verification framework for circuit-building quantum programs
C Chareton, S Bardin, F Bobot, V Perrelle, B Valiron
European Symposium on Programming, 148-177, 2021
1132021
Binsec/rel: Efficient relational symbolic execution for constant-time at binary-level
LA Daniel, S Bardin, T Rezk
2020 IEEE Symposium on Security and Privacy (SP), 1021-1038, 2020
1112020
FAST: acceleration from theory to practice
S Bardin, A Finkel, J Leroux, L Petrucci
International Journal on Software Tools for Technology Transfer 10 (5), 401-424, 2008
1072008
Symbolic deobfuscation: From virtualized code back to the original
J Salwan, S Bardin, ML Potet
International Conference on Detection of Intrusions and Malware, and …, 2018
1052018
The BINCOA framework for binary code analysis
S Bardin, P Herrmann, J Leroux, O Ly, R Tabary, A Vincent
International Conference on Computer Aided Verification, 165-170, 2011
982011
Backward-bounded DSE: targeting infeasibility questions on obfuscated codes
S Bardin, R David, JY Marion
2017 IEEE Symposium on Security and Privacy (SP), 633-651, 2017
972017
Refinement-based CFG reconstruction from unstructured programs
S Bardin, P Herrmann, F Védrine
International Workshop on Verification, Model Checking, and Abstract …, 2011
952011
Binsec: Binary code analysis with low-level regions
A Djoudi, S Bardin
International Conference on Tools and Algorithms for the Construction and …, 2015
862015
Structural testing of executables
S Bardin, P Herrmann
2008 1st International Conference on Software Testing, Verification, and …, 2008
832008
Hunting the haunter-efficient relational symbolic execution for spectre with haunted relse
LA Daniel, S Bardin, T Rezk
NDSS 2021-Network and Distributed Systems Security, 2021
722021
FASTer acceleration of counter automata in practice
S Bardin, A Finkel, J Leroux
International Conference on Tools and Algorithms for the Construction and …, 2004
722004
FAST Extended Release: (Tool Paper)
S Bardin, J Leroux, G Point
International Conference on Computer Aided Verification, 63-66, 2006
642006
Sound and quasi-complete detection of infeasible test requirements
S Bardin, M Delahaye, R David, N Kosmatov, M Papadakis, Y Le Traon, ...
2015 IEEE 8th International Conference on Software Testing, Verification and …, 2015
602015
OSMOSE: automatic structural testing of executables
S Bardin, P Herrmann
Software Testing, Verification and Reliability 21 (1), 29-54, 2011
602011
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections)
M Ollivier, S Bardin, R Bonichon, JY Marion
Proceedings of the 35th Annual Computer Security Applications Conference …, 2019
492019
Efficient leveraging of symbolic execution to advanced coverage criteria
S Bardin, N Kosmatov, F Cheynier
2014 IEEE Seventh International Conference on Software Testing, Verification …, 2014
492014
The system can't perform the operation now. Try again later.
Articles 1–20