paperbot · PL 论文追踪

全部论文 待读 收藏

P1 From Similarity Ranking to Definitive Verdict: LLM-Enhanced Source-to-Binary Function Localization

从相似度排序到确定性判定:LLM 增强的源码到二进制函数定位
OOPSLA 10(OOPSLA2)2026匹配度 5/10 · 该论文用 LLM 做源码到二进制函数定位(伪反编译表示对齐 + 差异摘要验证),属于“LLM 作为工具改进程序分析任务”的大方向,与 AI→PL 的选题气质相近,且具备问题驱动、对比基线失效分析和新数据集设计;但其任务(二进制定位/SCA)并非用户聚焦的静态分析、形式化验证、浮点程序分析或贝叶斯程序分析,也不涉及 Agentic/ML 系统的静态分析,因此只是方向边缘相关。引用 0 inbox
Jingyi Shi, Chengyue Liu, Zhengzi Xu, Yang Xiao, Xingchu Chen, Yeting Li, Wei Huo, Yang Liu
crossref: 2026-10-02

AI 速览

一句话:提出 XLoc,用 LLM 将源码转为伪反编译表示并提取差异摘要验证,实现源码到二进制函数的确定性定位。

源码到二进制函数定位要求给定目标函数源码及所属包,判断其是否存在于去符号二进制并报告地址,但面临跨模态对齐与相似函数消歧两大挑战。本文提出 XLoc,一个“先召回后验证”框架:召回阶段用 LLM 将源码转为与反编译输出对齐的伪反编译表示,实现多阶段召回;验证阶段提取易混淆相似函数的差异摘要,引导验证聚焦区分性证据,输出确定的接受/拒绝判定而非相似度排序。在 196 个 CVE、480 个漏洞函数和 756 个二进制上,XLoc 定位准确率最高达 84.4%,为最优基线的 4.2 倍;正负判别 HM 达 87.1%,基线仅 35.1%。

问题
给定目标函数源码及其所属源码包,判断该函数是否存在于去符号二进制中,若存在则报告其地址;核心挑战是跨模态对齐与相似函数消歧。
方法
XLoc 采用先召回后验证框架:用 LLM 将源码转为与二进制反编译对齐的伪反编译表示进行多阶段召回,再提取相似函数的差异摘要引导验证,输出确定的接受/拒绝判定。
评估
在两个互补数据集(196 个 CVE、480 个漏洞函数、756 个二进制)上评估,定位准确率最高 84.4%,正负判别 HM 达 87.1%,显著优于基线。
原文摘要(Abstract)

Locating a known source function in a stripped binary is a prerequisite for many security and software engineering tasks, including Software Composition Analysis (SCA) false-positive elimination, patch presence verification, malware analysis, code plagiarism detection, and license compliance auditing. We formalize this need as source-to-binary function localization: given the source code of a target function and its encompassing source package, determine whether the function is present in a stripped binary and, if so, report its address. Two fundamental challenges arise: cross-modal alignment, as source code and stripped binary reside in vastly different representation spaces; and similar function disambiguation, as compilation erases the symbolic features that distinguish functionally similar functions. We present XLoc, a recall-then-verify framework built on two insights. First, cross-modal alignment does not require costly and error-prone compilation; it only demands token-level alignment, a process that can be reliably approximated. Second, the information needed to disambiguate similar functions is already available on the source side and can be extracted ahead of time to guide verification. Building on these insights, XLoc implements a multi-stage recall module in which an LLM transforms source code into pseudo-decompiled representations aligned with binary decompilation output, bridging the cross-modal gap. For verification, XLoc identifies potentially confusing similar functions, extracts differential summaries, and uses them to guide the verification process toward the specific distinguishing evidence for each candidate, producing definitive accept/reject verdicts rather than similarity rankings. We evaluate XLoc on two complementary datasets spanning 196 CVEs, 480 vulnerable functions, and 756 binaries. XLoc achieves up to 84.4% localization accuracy (4.2× over the best baseline) and HM=87.1% for positive/negative discrimination (vs. 35.1% for the best baseline). These results demonstrate that XLoc can locate target functions with high accuracy, reliably discriminate between positive and negative cases, and produce definitive verdicts.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot12163,
  title = {From Similarity Ranking to Definitive Verdict: LLM-Enhanced Source-to-Binary Function Localization},
  author = {Jingyi Shi and Chengyue Liu and Zhengzi Xu and Yang Xiao and Xingchu Chen and Yeting Li and Wei Huo and Yang Liu},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {10},
  number = {OOPSLA2},
  year = {2026},
  doi = {10.1145/3839539}
}