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

Luke Dramko

dblp:344/2527 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-5845-5628ORCID · verified

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

Security and privacy · 3 · 3 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 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.

Software engineering, system software, and programming languages
3 papers
Compilers and program optimization · 58% Software maintenance and evolution · 18% Program synthesis and code generation · 16%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
decompilation
2.432026
Idioms: A Simple and Effective Framework for Turbo-Charging Local Neural Decompilation with Well-Defined Types · NDSS 2026
A Taxonomy of C Decompiler Fidelity Issues · USENIX Security Symposium 2024
DIRE and its Data: Neural Decompiled Variable Renamings with Respect to Software Class · ACM Trans. Softw. Eng. Methodol. 2023
Software maintenance and evolution
reverse engineering
0.812024
A Taxonomy of C Decompiler Fidelity Issues · USENIX Security Symposium 2024
Program synthesis and code generation › code generation with language models
training data quality
0.712023
DIRE and its Data: Neural Decompiled Variable Renamings with Respect to Software Class · ACM Trans. Softw. Eng. Methodol. 2023
Programming languages and type systems
type inference
0.312026
Idioms: A Simple and Effective Framework for Turbo-Charging Local Neural Decompilation with Well-Defined Types · NDSS 2026

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

neural decompilation · 1.7type inference · 1.0empirical study · 0.8machine learning · 0.7
YearPublicationVenuePosition
2026 Idioms: A Simple and Effective Framework for Turbo-Charging Local Neural Decompilation with Well-Defined Types
Luke Dramko, Claire Le Goues, Edward J. Schwartz
NDSS1
2025 Quantifying and Mitigating the Impact of Obfuscations on Machine-Learning-Based Decompilation Improvement
Luke Dramko, Deniz Bölöni-Turgut, Claire Le Goues, Edward J. Schwartz
DIMVA (1)1
2024 A Taxonomy of C Decompiler Fidelity Issues
Luke Dramko, Jeremy Lacomis, Edward J. Schwartz, Bogdan Vasilescu, Claire Le Goues
USENIX Security Symposium1
2023 DIRE and its Data: Neural Decompiled Variable Renamings with Respect to Software Class
abstract
The decompiler is one of the most common tools for examining executable binaries without the corresponding source code. It transforms binaries into high-level code, reversing the compilation process. Unfortunately, decompiler output is far from readable because the decompilation process is often incomplete. State-of-the-art techniques use machine learning to predict missing information like variable names. While these approaches are often able to suggest good variable names in context, no existing work examines how the selection of training data influences these machine learning models. We investigate how data provenance and the quality of training data affect performance, and how well, if at all, trained models generalize across software domains. We focus on the variable renaming problem using one such machine learning model, DIRE . We first describe DIRE in detail and the accompanying technique used to generate training data from raw code. We also evaluate DIRE ’s overall performance without respect to data quality. Next, we show how training on more popular, possibly higher quality code (measured using GitHub stars) leads to a more generalizable model because popular code tends to have more diverse variable names. Finally, we evaluate how well DIRE predicts domain-specific identifiers, propose a modification to incorporate domain information, and show that it can predict identifiers in domain-specific scenarios 23% more frequently than the original DIRE model.
Luke Dramko, Jeremy Lacomis, Edward J. Schwartz, Miltiadis Allamanis, Graham Neubig, Bogdan Vasilescu, Claire Le Goues
ACM Trans. Softw. Eng. Methodol.1