Demo Data from VLDB 2026 / reviewers in the wild / expert
Ziyang Huang 0004
dblp:240/8001-4
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0009-2764-6091ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Security 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.
| Software engineering, system software, and programming languages
2 papers |
Program analysis · 43% Program synthesis and code generation · 43% Compilers and program optimization · 15% | |
| Network and information security
1 paper |
Systems and software security · 100% | |
| Artificial intelligence
1 paper |
Language models and text generation · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security
binary analysis |
0.9 | 1 | 2025 | Unleashing the Power of Generative Model in Recovering Variable Names from Stripped Binary · NDSS 2025 |
Program analysis
binary analysis |
0.8 | 1 | 2024 | Source Code Foundation Models are Transferable Binary Analysis Knowledge Bases · NeurIPS 2024 |
Program synthesis and code generation
code language model |
0.8 | 1 | 2024 | Source Code Foundation Models are Transferable Binary Analysis Knowledge Bases · NeurIPS 2024 |
Compilers and program optimization
decompilation |
0.3 | 1 | 2025 | Unleashing the Power of Generative Model in Recovering Variable Names from Stripped Binary · NDSS 2025 |
Natural language and speech › Language models and text generation
large language model |
0.2 | 1 | 2024 | Source Code Foundation Models are Transferable Binary Analysis Knowledge Bases · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
machine learning · 1.7generative model · 1.7transfer learning · 1.5prompting · 1.5encoder-decoder model · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Unleashing the Power of Generative Model in Recovering Variable Names from Stripped Binary
Xiangzhe Xu, Zhuo Zhang 0002, Zian Su, Ziyang Huang 0004, Shiwei Feng 0002, Yapeng Ye, Nan Jiang 0012, Danning Xie, Siyuan Cheng 0005, Lin Tan 0001, Xiangyu Zhang 0001 |
NDSS | 4 |
| 2024 | Source Code Foundation Models are Transferable Binary Analysis Knowledge BasesabstractHuman-Oriented Binary Reverse Engineering (HOBRE) lies at the intersection of binary and source code, aiming to lift binary code to human-readable content relevant to source code, thereby bridging the binary-source semantic gap. Recent advancements in uni-modal code model pre-training, particularly in generative Source Code Foundation Models (SCFMs) and binary understanding models, have laid the groundwork for transfer learning applicable to HOBRE. However, existing approaches for HOBRE rely heavily on uni-modal models like SCFMs for supervised fine-tuning or general LLMs for prompting, resulting in sub-optimal performance. Inspired by recent progress in large multi-modal models, we propose that it is possible to harness the strengths of uni-modal code models from both sides to bridge the semantic gap effectively. In this paper, we introduce a novel probe-and-recover framework that incorporates a binary-source encoder-decoder model and black-box LLMs for binary analysis. Our approach leverages the pre-trained knowledge within SCFMs to synthesize relevant, symbol-rich code fragments as context. This additional context enables black-box LLMs to enhance recovery accuracy. We demonstrate significant improvements in zero-shot binary summarization and binary function name recovery, with a 10.3% relative gain in CHRF and a 16.7% relative gain in a GPT4-based metric for summarization, as well as a 6.7% and 7.4% absolute increase in token-level precision and recall for name recovery, respectively. These results highlight the effectiveness of our approach in automating and improving binary code analysis. Zian Su, Xiangzhe Xu, Ziyang Huang 0004, Kaiyuan Zhang 0002, Xiangyu Zhang 0001 |
NeurIPS | 3 |