arXiv Machine Learning

SpIDER: Spatially Informed Dense Embedding Retrieval for Software Issue Localization

SpIDER is a dense retrieval method that combines LLM reasoning with graph-based exploration of codebases to locate relevant functions, classes, or files for user queries. It introduces a graph-structured benchmark, SpIDER-Bench, covering multiple programming languages and demonstrates significant recall improvements over traditional BM25 and dense approaches. The method’s graph-based candidate expansion provides auditable structural reasons for each retrieved item while keeping the retrieval budget fixed.

arXiv AI
Jul 3

BLAgent: Agentic RAG for File-Level Bug Localization

arXiv:2605. 17965v2 Announce Type: replace-cross Abstract: Bug localization remains a key bottleneck for large language model (LLM)-based software maintenance, where accurately identifying faulty code is essential for debugging, root cause analysis, triage, and automated program repair (APR).

By Md Afif Al Mamun, Gias Uddin
arXiv AI
Jun 16

AlignCoder: Aligning Retrieval with Target Intent for Repository-Level Code Completion

arXiv:2601. 19697v2 Announce Type: replace-cross Abstract: Repository-level code completion remains a challenging task for existing code large language models (code LLMs) due to their limited understanding of repository-specific context and domain knowledge.

By Tianyue Jiang, Yanli Wang, Yanlin Wang, Daya Guo, Ensheng Shi, Yuchi Ma, Jiachi Chen, Zibin Zheng
arXiv Computation and Language
Sep 3

ExecRetrieval: Measuring the Functional-Correctness Gap in Code-Embedding Retrieval

ExecRetrieval is a new benchmark for code‑embedding retrieval that contains 939 Python tasks, each with a verified correct implementation and up to four single‑edit buggy distractors generated mechanically. The dataset allows direct testing of a retriever’s ability to functionally discriminate correct code from near‑clone incorrect code, rather than relying on lexical similarity. Experiments on 23 dense embeddings and BM25 show that while the best system can retrieve the correct code within the top 10 results, it often fails to rank the correct implementation first, with rank‑1 errors dominated by paired buggy variants.

By Aaryan Kapoor, Md Abdullah Al Hafiz Khan