Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDSébastien Bardin
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c34]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- [i18]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) - [i17]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) - 2020
- [c33]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: 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 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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-10 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
