Demo Data from SIGIR 2026 / reviewers in the wild / expert
Emmanuel Fleury
dblp:27/6022
· DBLP profile ↗
10ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6Software engineering, systems software and programming languages · 5 · 1 first-authorSecurity and privacy · 1 · 1 since 2021
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.
| Network and information security
1 paper |
Systems and software security · 100% | |
| Theoretical computer science
2 papers |
Automata and formal languages · 85% Automated reasoning and model checking · 15% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security › exploitation
code reuse attack |
0.9 | 1 | 2025 | Nothing is Unreachable: Automated Synthesis of Robust Code-Reuse Gadget Chains for Arbitrary Exploitation Primitives · USENIX Security Symposium 2025 |
Systems and software security
exploitation |
0.9 | 1 | 2025 | Nothing is Unreachable: Automated Synthesis of Robust Code-Reuse Gadget Chains for Arbitrary Exploitation Primitives · USENIX Security Symposium 2025 |
Automata and formal languages
timed automata |
0.1 | 2 | 2007 | UPPAAL-Tiga: Time for Playing Games! · CAV 2007 Are Timed Automata Updatable? · CAV 2000 |
Automata and formal languages › timed automata
timed games |
0.1 | 1 | 2007 | UPPAAL-Tiga: Time for Playing Games! · CAV 2007 |
Automated reasoning and model checking
model checking |
0.0 | 1 | 2007 | UPPAAL-Tiga: Time for Playing Games! · CAV 2007 |
Automated reasoning and model checking
real-time verification |
0.0 | 1 | 2000 | Are Timed Automata Updatable? · CAV 2000 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Nothing is Unreachable: Automated Synthesis of Robust Code-Reuse Gadget Chains for Arbitrary Exploitation Primitives
Nicolas Bailluet, Emmanuel Fleury, Isabelle Puaut, Erven Rohou |
USENIX Security Symposium | 2 |
| 2015 | Insight: An Open Binary Analysis Framework
Emmanuel Fleury, Olivier Ly, Gérald Point, Aymeric Vincent |
TACAS | 1 |
| 2008 | Accelerating Interpolation-Based Model-Checking
Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun |
TACAS | 2 |
| 2007 | UPPAAL-Tiga: Time for Playing Games!
Gerd Behrmann, Agnès Cougnard, Alexandre David, Emmanuel Fleury, Kim G. Larsen, Didier Lime |
CAV | 4 |
| 2005 | Efficient On-the-Fly Algorithms for the Analysis of Timed Games
Franck Cassez, Alexandre David, Emmanuel Fleury, Kim G. Larsen, Didier Lime |
CONCUR | 3 |
| 2004 | Optimal Strategies in Priced Timed Game Automata
Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim G. Larsen |
FSTTCS | 3 |
| 2004 | Updatable timed automata
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001 |
Theor. Comput. Sci. | 3 |
| 2003 | Static Guard Analysis in Timed Automata Verification
Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim G. Larsen |
TACAS | 3 |
| 2000 | Are Timed Automata Updatable?
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001 |
CAV | 3 |
| 2000 | Expressiveness of Updatable Timed Automata
Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit 0001 |
MFCS | 3 |