Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Moritz Dannehl

dblp:298/2245 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 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
Malware analysis · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Artificial intelligence
2 papers
Representation and self-supervised learning · 57% Learning theory · 43%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
binary analysis
0.712023
XFL: Naming Functions in Binaries with Extreme Multi-label Learning · SP 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
BLens: Contrastive Captioning of Binary Functions using Ensemble Embedding · USENIX Security Symposium 2025
Machine learning › Learning theory › classification › multiclass classification
extreme classification
0.212023
XFL: Naming Functions in Binaries with Extreme Multi-label Learning · SP 2023

Methods — techniques the papers use, named apart from their topics

ensemble embedding · 1.7contrastive learning · 1.7captioning · 1.7static analysis · 1.3function embedding · 1.3extreme multi-label learning · 1.3
YearPublicationVenuePosition
2025 BLens: Contrastive Captioning of Binary Functions using Ensemble Embedding
Tristan Benoit, Yunru Wang, Moritz Dannehl, Johannes Kinder
USENIX Security Symposium3
2023 XFL: Naming Functions in Binaries with Extreme Multi-label Learning
abstract
Reverse engineers benefit from the presence of identifiers such as function names in a binary, but usually these are removed for release. Training a machine learning model to predict function names automatically is promising but fundamentally hard: unlike words in natural language, most function names occur only once. In this paper, we address this problem by introducing eXtreme Function Labeling (XFL), an extreme multi-label learning approach to selecting appropriate labels for binary functions. XFL splits function names into tokens, treating each as an informative label akin to the problem of tagging texts in natural language. We relate the semantics of binary code to labels through Dexter, a novel function embedding that combines static analysis-based features with local context from the call graph and global context from the entire binary. We demonstrate that XFL/Dexter outperforms the state of the art in function labeling on a dataset of 10,047 binaries from the Debian project, achieving a precision of 83.5%. We also study combinations of XFL with alternative binary embeddings from the literature and show that Dexter consistently performs best for this task. As a result, we demonstrate that binary function labeling can be effectively phrased in terms of multi-label learning, and that binary function embeddings benefit from including explicit semantic features.
James Patrick-Evans, Moritz Dannehl, Johannes Kinder
SP2