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

Xiaoao Zhu

dblp:410/2497 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 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
1 paper
Program analysis · 50% Compilers and program optimization · 50%

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

TopicWeightPapersLastEvidence papers
Program analysis
binary analysis
1.012026
Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification · ACL (1) 2026
Program analysis › binary analysis
binary lifting
1.012026
Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification · ACL (1) 2026
Compilers and program optimization
decompilation
1.012026
Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification · ACL (1) 2026
Compilers and program optimization
intermediate representation
1.012026
Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification · ACL (1) 2026

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

retrieval-augmented generation · 1.0pseudo-probe instrumentation · 1.0large language model · 1.0iterative verification · 1.0
YearPublicationVenuePosition
2026 Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification
abstract
Lifting stripped and highly optimized binaries to the canonical compiler intermediate representation (IR) enables program analysis when source code is unavailable.However, compiler optimizations severely distort controlflow and data-flow structure, making existing rule-based and LLM-based decompilation approaches brittle.We present BRIDGE, a system that reliably lifts optimized binaries to analysis-friendly compiler IR.BRIDGE combines control-flow-aware retrieval-augmented generation with feedback-driven verification.It uses pseudo-probe instrumentation to align optimized binary fragments with normalized IR semantics, and then employs an iterative refinement loop guided by static analysis and runtime feedback to improve executability and semantic consistency.We evaluate BRIDGE on HumanEval-Decompile and MBPP, lifting x86-64 and ARM64 binaries to LLVM IR.BRIDGE outperforms seven baselines, achieving an average of over 30% higher re-executability than the strongest general-purpose LLM baseline.Void func (){ PROBE(1); If else branch …… PROBE(2); PROBE(3); for Loop … PROBE(4);}
Xiaoao Zhu, Jie Ren 0007, Zhiqiang Li 0003, Jie Zheng 0005, Zhanyong Tang, Zheng Wang 0001
ACL (1)1
2025 LLVMTuner: Predictive Compiler Optimization for LLVM IR Across Heterogeneous Platforms
abstract
The Low Level Virtual Machine Intermediate Representation (LLVM IR) is a key component of modern compilers, valued for its universality and cross-platform adaptability. However, identifying optimal optimization passes across platforms remains challenging, as current autotuning frameworks struggle on mobile devices due to resource constraints and network variability. This paper introduces a novel LLVM IR performance optimization framework, LL VMTUNER. At its core is a deep neural network-based predictive model specifically designed to forecast the execution time of input passes on various platforms by analyzing IR features. By integrating this predictive model with the advanced autotuning framework, we enable a rapid and precise search for optimal pass list, removing the need for real-time latency measurements on target platforms and reducing data transmission between devices and cloud-based autotuning frameworks. LLVMTuner significantly enhances the performance of LLVM IR, providing a robust solution for efficient compiler optimizations across a spectrum of computing environments, from high-performance laptops to resource-constrained mobile devices. We evaluate LL VMTuNER on three heterogeneous platforms using over 600 LLVM IR benchmarks. The results show that LLVMTuner achieves an average speedup of 2.41x over the -03 optimization configuration. Additionally, LL VMTUNER reduces search overhead by 83.68% compared to OpenTuner.
Xiaoao Zhu, Jie Ren 0007, Zhiqiang Li 0003, Feng Tian 0005, Jie Zheng 0005
CSCWD1