Sébastien Bardin

Orcid: 0000-0002-6509-3506

Affiliations:
  • Université Paris-Saclay, CEA, France


According to our database1, Sébastien Bardin authored at least 74 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Inference of Robust Reachability Constraints.
Proc. ACM Program. Lang., January, 2024

2023
Binsec/Rel: Symbolic Binary Analyzer for Security with Applications to Constant-Time and Secret-Erasure.
ACM Trans. Priv. Secur., May, 2023

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy (Extended version).
CoRR, 2023

ProSpeCT: Provably Secure Speculation for the Constant-Time Policy.
Proceedings of the 32nd USENIX Security Symposium, 2023

Scalable Program Clone Search through Spectral Analysis.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

Active Disjunctive Constraint Acquisition.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Adversarial Reachability for Program-level Security Analysis.
Proceedings of the Programming Languages and Systems, 2023

A Systematic Evaluation of Automated Tools for Side-Channel Vulnerabilities Detection in Cryptographic Libraries.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Formal Methods for Quantum Algorithms.
Proceedings of the Handbook of Formal Analysis and Verification in Cryptography, 2023

2022
Machine Learning and Logical Reasoning: The New Frontier (Dagstuhl Seminar 22291).
Dagstuhl Reports, July, 2022

A Quantitative Flavour of Robust Reachability.
CoRR, 2022

Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Specify and measure, cover and reveal: A unified framework for automated test generation.
Sci. Comput. Program., 2021

Formal Methods for Quantum Programs: A Survey.
CoRR, 2021

AI-based Blackbox Code Deobfuscation: Understand, Improve and Mitigate.
CoRR, 2021

Binary level toolchain provenance identification with graph neural networks.
Proceedings of the 28th IEEE International Conference on Software Analysis, 2021

Program Protection through Software-based Hardware Abstraction.
Proceedings of the 18th International Conference on Security and Cryptography, 2021

No Crash, No Exploit: Automated Verification of Embedded Kernels.
Proceedings of the 27th IEEE Real-Time and Embedded Technology and Applications Symposium, 2021

Hunting the Haunter - Efficient Relational Symbolic Execution for Spectre with Haunted RelSE.
Proceedings of the 28th Annual Network and Distributed System Security Symposium, 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".
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering: Companion Proceedings, 2021

Interface Compliance of Inline Assembly: Automatically Check, Patch and Refine.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

Evaluating Defensive Countermeasures for Software-Based Hardware Abstraction.
Proceedings of the E-Business and Telecommunications - 18th International Conference, 2021

A Tight Integration of Symbolic Execution and Fuzzing (Short Paper).
Proceedings of the Foundations and Practice of Security - 14th International Symposium, 2021

An Automated Deductive Verification Framework for Circuit-building Quantum Programs.
Proceedings of the Programming Languages and Systems, 2021

Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate (Poster).
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Automatically Proving Microkernels Free from Privilege Escalation from their Executable.
CoRR, 2020

Toward certified quantum programming.
CoRR, 2020

Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities.
Proceedings of the 23rd International Symposium on Research in Attacks, 2020

2019
Bringing CP, SAT and SMT together: Next Challenges in Constraint Solving (Dagstuhl Seminar 19062).
Dagstuhl Reports, 2019

Get rid of inline assembly through trustable verification-oriented lifting.
CoRR, 2019

Get Rid of Inline Assembly through Verification-Oriented Lifting.
Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering, 2019

How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections).
Proceedings of the 35th Annual Computer Security Applications Conference, 2019

2018
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Test Case Generation with PathCrawler/LTest: How to Automate an Industrial Testing Process.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018

Time to clean your test objectives.
Proceedings of the 40th International Conference on Software Engineering, 2018

Symbolic Deobfuscation: From Virtualized Code Back to the Original.
Proceedings of the Detection of Intrusions and Malware, and Vulnerability Assessment, 2018

Model Generation for Quantified Formulas: A Taint-Based Approach.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Abstract Interpretation using a Language of Symbolic Approximation.
CoRR, 2017

Freeing Testers from Polluting Test Objectives.
CoRR, 2017

CDCL-inspired Word-level Learning for Bit-vector Constraint Solving.
CoRR, 2017

Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Efficient and Complete FD-solving for extended array constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Generic and Effective Specification of Structural Test Objectives.
Proceedings of the 2017 IEEE International Conference on Software Testing, 2017

Taming Coverage Criteria Heterogeneity with LTest.
Proceedings of the 2017 IEEE International Conference on Software Testing, 2017

Sharpening Constraint Programming Approaches for Bit-Vector Theory.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Targeting Infeasibility Questions on Obfuscated Codes.
CoRR, 2016

BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis.
Proceedings of the IEEE 23rd International Conference on Software Analysis, 2016

Specification of concretization and symbolization policies in symbolic execution.
Proceedings of the 25th International Symposium on Software Testing and Analysis, 2016

Recovering High-Level Conditions from Binary Programs.
Proceedings of the FM 2016: Formal Methods, 2016

Finding the needle in the heap: combining static analysis and dynamic symbolic execution to trigger use-after-free.
Proceedings of the 6th Workshop on Software Security, Protection, and Reverse Engineering, 2016

2015
BINSEC: Binary Code Analysis with Low-Level Regions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Sound and Quasi-Complete Detection of Infeasible Test Requirements.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015

2014
An All-in-One Toolkit for Automated White-Box Testing.
Proceedings of the Tests and Proofs - 8th International Conference, 2014

Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria.
Proceedings of the Seventh IEEE International Conference on Software Testing, 2014

2013
Efficient Leverage of Symbolic ATG Tools to Advanced Coverage Criteria.
CoRR, 2013

A Combined Approach for Constraints over Finite Domains and Arrays.
CoRR, 2013

Binary-Level Testing of Embedded Programs.
Proceedings of the 2013 13th International Conference on Quality Software, 2013

2012
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
OSMOSE: automatic structural testing of executables.
Softw. Test. Verification Reliab., 2011

Refinement-Based CFG Reconstruction from Unstructured Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

The BINCOA Framework for Binary Code Analysis.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
An Alternative to SAT-Based Approaches for Bit-Vectors.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

2009
Pruning the Search Space in Path-Based Test Generation.
Proceedings of the Second International Conference on Software Testing Verification and Validation, 2009

2008
FAST: acceleration from theory to practice.
Int. J. Softw. Tools Technol. Transf., 2008

Structural Testing of Executables.
Proceedings of the First International Conference on Software Testing, 2008

2006
FAST Extended Release.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

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).
PhD thesis, 2005

Flat Acceleration in Symbolic Model Checking.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
FASTer Acceleration of Counter Automata in Practice.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Composition of Accelerations to Verify Infinite Heterogeneous Systems.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
FAST: Fast Acceleration of Symbolikc Transition Systems.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003


  Loading...