Demo Data from VLDB 2026 / reviewers in the wild / expert
Philippe Herrmann
dblp:18/4152
· DBLP profile ↗
8ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 6Theory of computation · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
binary analysis |
0.1 | 1 | 2011 | The BINCOA Framework for Binary Code Analysis · CAV 2011 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | The BINCOA Framework for Binary Code Analysis
Sébastien Bardin, Philippe Herrmann, Jérôme Leroux, Olivier Ly, Renaud Tabary, Aymeric Vincent |
CAV | 2 |
| 2011 | Refinement-Based CFG Reconstruction from Unstructured Programs
Sébastien Bardin, Philippe Herrmann, Franck Védrine |
VMCAI | 2 |
| 2011 | OSMOSE: automatic structural testing of executablesabstractAbstract Verification is usually performed on a high‐level view of the software, either specification or program source code. However, in certain circumstances verification is more relevant when performed at the machine‐code level. This paper focuses on automatic test data generation from a stand‐alone executable. Low‐level analysis is much more difficult than high‐level analysis since even the control‐flow graph is not available and bit‐level instructions have to be modelled faithfully. The paper shows how ‘path‐based’ structural test data generation can be adapted from structured language to machine code, using both state‐of‐the‐art technologies and innovative techniques. The results have been implemented in a tool named OSMOSE and encouraging experiments have been conducted. Copyright © 2010 John Wiley & Sons, Ltd. Sébastien Bardin, Philippe Herrmann |
Softw. Test. Verification Reliab. | 2 |
| 2010 | An Alternative to SAT-Based Approaches for Bit-Vectors
Sébastien Bardin, Philippe Herrmann, Florian Perroud |
TACAS | 2 |
| 2009 | Pruning the Search Space in Path-Based Test GenerationabstractRecent advances in path-based test (data) generation open the way to the systematic testing of large scale programs. However, these technologies are still suffering from two major bottlenecks: efficient constraint solving and the path explosion phenomenon. We focus in this paper on the second issue and propose three complementary heuristics geared toward lowering path explosion. All these heuristics are both easy to implement and lightweight, and each one deals with a distinct source of path explosion. We provide theoretical and experimental evidence that they can achieve a significant reduction in the search space. Sébastien Bardin, Philippe Herrmann |
ICST | 2 |
| 2008 | Structural Testing of ExecutablesabstractVerification is usually performed on a high-level view of the software, either specification or program source code. However in certain circumstances verification is more relevant when performed at the machine code level. This paper focuses on automatic test data generation from a standalone executable. Low-level analysis is much more difficult than high-level analysis since even the control-flow graph is not available and bit-level instructions have to be modelled faithfully. We show how "path-based" structural test data generation can be adapted from structured language to machine code, using both state-of-the-art technologies and innovative techniques. Our results have been implemented in a tool named OSMOSE and encouraging experiments have been conducted. Sébastien Bardin, Philippe Herrmann |
ICST | 2 |
| 1999 | Renaming is Necessary in Timed Regular Expressions
Philippe Herrmann |
FSTTCS | 1 |
| 1998 | Timed Automata and Recognizability
Philippe Herrmann |
Inf. Process. Lett. | 1 |