CP-BCS: Binary Code Summarization Guided by Control Flow Graph and Pseudo Code (2023.emnlp-main)
Copied to clipboard
| Challenge: | Current work on understanding assembly code is oriented towards generating function names, which involve numerous abbreviations that make them confusing. |
| Approach: | They propose a control flow graph and pseudo code guided binary code summarization framework to learn the comprehensive binary function execution behavior and logic semantics. |
| Outcome: | The proposed framework improves the efficiency of reverse engineering on 3 different binary optimization levels for 3 different computer architectures. |
Similar Papers
HierarchyNet: Learning to Summarize Source Code with Heterogeneous Representations (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing code summarization approaches ignore the interplay of dependencies among program elements and code hierarchy. |
| Approach: | They propose a code summarization approach utilizing Heterogeneous Code Representations (HCRs) and HierarchyNet. |
| Outcome: | The proposed method improves on existing models and pre-trained models. |
Transforming Code Understanding: Clustering-Based Retrieval for Improved Summarization in Domain-Specific Languages (2025.coling-industry)
Copied to clipboard
Baban Gain, Dibyanayan Bandyopadhyay, Samrat Mukherjee, Aryan Sahoo, Saswati Dana, Palanivel Kodeswaran, Sayandeep Sen, Asif Ekbal, Dinesh Garg
| Challenge: | Existing natural language summaries of domain-specific languages are limited due to their recency and complexity. |
| Approach: | They propose a clustering-based technique to retrieve in-context examples that are semantically closer to the test example and propose eBPF prompt generation technique that yields superior-quality code summary generation. |
| Outcome: | The proposed method improves the eBPF code summarization accuracy by 12.9 BLEU points over other prompting techniques. |
Unsupervised Binary Code Translation with Application to Code Clone Detection and Vulnerability Discovery (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a recent study shows that binary code analysis is a key problem in software security research. |
| Approach: | They propose to apply Neural Machine Translation to binary code analysis . they translate a binary in a low-resource ISA and train a model on the high-resourced ISA . |
| Outcome: | The proposed model can be used to analyze binary code across ISAs using a high-resource ISA. |
Rethinking-based Code Summarization with Chain of Comments (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods focus on learning a direct mapping from pure code to summaries, overlooking the heterogeneity gap between code and summary. |
| Approach: | They propose a framework that uses chain of comments as auxiliary intermediate information to bridge the gap between code and summaries. |
| Outcome: | The proposed framework outperforms baseline models and multiple code Large Language Models by a large margin. |
HintPilot: LLM-based Compiler Hint Synthesis for Code Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to optimize source code rely on invasive transformations that can introduce semantic errors and miss fine-grained compiler-level optimization opportunities. |
| Approach: | They propose a method that bridges LLM-based reasoning with traditional compilers by synthesizing compiler hints. |
| Outcome: | HintPilot achieves 6.88x speedup over -Ofast while preserving program correctness. |
CodeIF: Benchmarking the Instruction-Following Capabilities of Large Language Models for Code Generation (2025.acl-industry)
Copied to clipboard
| Challenge: | CodeIF assesses the ability of large language models to adhere to task-oriented instructions in code generation tasks. |
| Approach: | They introduce a benchmark designed to assess LLMs' ability to adhere to task-oriented instructions within diverse code generation scenarios. |
| Outcome: | The proposed benchmark assesses LLMs' ability to adhere to task-oriented instructions in code generation tasks across a wide range of complexity levels and programming domains. |
Lifting Optimized Binaries to Canonical Compiler IR via Structure-Aware Retrieval and Iterative Verification (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for decompiling binary code are brittle due to compiler optimizations that distort control-flow and data-flow structure. |
| Approach: | They propose a system that lifts optimized binaries to canonical compiler intermediate representation (IR) BRIDGE uses control-flow-aware retrieval-augmented generation with feedback-driven verification . |
| Outcome: | The proposed system outperforms seven baselines on humanEval-Decompile and MBPP, lifting x86-64 and ARM64 binaries to LLVM IR. |
\mathcal XFT: Unlocking the Power of Code Instruction Tuning by Simply Merging Upcycled Mixture-of-Experts (2024.acl-long)
Copied to clipboard
| Challenge: | Existing studies focus on the data perspectives of instruction tuning, leaving room for exploring advanced training schemes. |
| Approach: | They argue that prior works overlook the possibility of improving code instruction tuning by advancing existing training schemes. |
| Outcome: | The proposed model is dense because all parameters are activated to predict the next token (assuming it is a decoder-only LLM). |
C3PO: A Lightweight Copying Mechanism for Translating Pseudocode to Code (2022.aacl-srw)
Copied to clipboard
| Challenge: | Existing low-code translators that translate pseudocode to code are expensive in terms of data and compute. |
| Approach: | They propose a lightweight alternative that exploits the property of code wherein most tokens can be simply copied from the pseudocode. |
| Outcome: | The proposed model reduces the computational cost and vocabulary sizes while reducing the computational costs and complexity. |
CGBridge: Bridging Code Graphs and Large Language Models for Better Structure-Aware Code Understanding (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing structure-aware approaches treat structure as serialized text prompts or auxiliary training objectives, failing to provide explicit guidance during inference. |
| Approach: | They propose a plug-and-play method that enhances Large Language Models with Code Graph information through an external, trainable Bridge module. |
| Outcome: | The proposed method decouples structural reasoning from textual generation without updating the backbone. |