Beyond Text Matching: Towards Reference-Free Evaluation for Human-Oriented Binary Reverse Engineering
Not on the map. Why?
Abstract (arXiv)
Human-Oriented Binary Reverse Engineering (HOBRE) aims to transform decompiled pseudocode into a more human-friendly representation, thereby reducing the cognitive burden of reverse analysis and improving efficiency. However, reliably evaluating HOBRE outputs remains a fundamental challenge: human evaluation is costly, time-consuming, and difficult to scale, while existing automated metrics either require executable test cases and runtime environments that are often unavailable for real-world binaries, or rely on high-quality source code references that are typically inaccessible and fail to capture semantically equivalent but lexically diverse outputs. Although LLM-as-a-Judge paradigm is naturally well-suited to HOBRE evaluation, its effectiveness remains underexplored. This paper presents the first systematic investigation of the LLM-as-a-Judge paradigm for HOBRE across three representative tasks: function name recovery, binary code summarization, and decompilation optimization. We introduce BinJudgeBench, the first expert-annotated, reference-free evaluation benchmark based on multi-dimensional human judgment, where LLM-as-a-Judge achieves an average correlation of 63.20% with human judgment, outperforming traditional automated metrics at 35.04%. By analyzing judge configurations across backbone LLMs, prompting strategies, and decoding temperatures, we find that no ``one-size-fits-all'' configuration exists, as the optimal setup varies across tasks and individual samples. To address this, we propose BinJudge, which employs a lightweight routing mechanism to adaptively select the optimal judge configuration for each task and sample. BinJudge improves correlation with human experts by 4.5%-24.7% and reduces API cost to 0.06×-0.84× of that of static best configurations, providing a scalable, cost-effective, and high-fidelity automated evaluation scheme for HOBRE.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 69 references that are in the map. First posted on arXiv 7 Aug 2026.
Builds on
28 of 69 references.
References · 28
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2025Qwen3 Technical Reportcited by 8,195
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,655
- 2023Code Llama: Open Foundation Models for Codecited by 2,105
- 2024Qwen2.5-Coder Technical Reportcited by 1,151
- 2024From Generation to Judgment: Opportunities and Challenges of LLM-as-a-judgecited by 480
- 2020CodeBLEU: a Method for Automatic Evaluation of Code Synthesiscited by 468
- 2019MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distancecited by 415
- 2024DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligencecited by 325
- 2023CodeBERTScore: Evaluating Code Generation with Pretrained Models of Codecited by 101
- 2025Can LLMs Replace Human Evaluators? An Empirical Study of LLM-as-a-Judge in Software Engineeringcited by 64
16 more
- 2024CodeUltraFeedback: An LLM-as-a-Judge Dataset for Aligning Large Language Models to Coding Preferencescited by 56
- 2023ICE-Score: Instructing Large Language Models to Evaluate Codecited by 50
- 2019Does BLEU Score Work for Code Migration?cited by 49
- 2024Can LLMs Replace Manual Annotation of Software Engineering Artifacts?cited by 40
- 2023Extending Source Code Pre-Trained Language Models to Summarise Decompiled Binariescited by 25
- 2023Refining Decompiled C Code with Large Language Modelscited by 24
- 2021Augmenting Decompiler Output with Learned Variable Names and Typescited by 23
- 2024Leveraging LLMs for the Quality Assurance of Software Requirementscited by 15
- 2024Source Code Foundation Models are Transferable Binary Analysis Knowledge Basescited by 8
- 2024LLMs as Evaluators: A Novel Approach to Evaluate Bug Report Summarizationcited by 6
- 2024MALSIGHT: Exploring Malicious Source Code and Benign Pseudocode for Iterative Binary Malware Summarizationcited by 5
- 2025ReCopilot: Reverse Engineering Copilot in Binary Analysiscited by 4
- 2024A Novel HDL Code Generator for Effectively Testing FPGA Logic Synthesis Compilerscited by 3
- 2024FoC: Figure out the Cryptographic Functions in Stripped Binaries with LLMscited by 2
- 2025Evaluating Generated Commit Messages with Large Language Modelscited by 2
- 2025FidelityGPT: Correcting Decompilation Distortions with Retrieval Augmented Generationcited by 2
Built on by
Not cited yet.