AIMay 20, 2025

Knowledge Graph Based Repository-Level Code Generation

arXiv:2505.14394v16 citationsh-index: 52025 IEEE/ACM International Workshop on Large Language Models for Code (LLM4Code)
Originality Incremental advance
AI Analysis

This work addresses the need for more robust and context-sensitive coding assistance tools, representing an incremental improvement over existing methods.

The paper tackles the problem of contextual inaccuracy in LLM-based code generation for evolving codebases by introducing a knowledge graph-based approach for code search and retrieval, demonstrating significant outperformance over baselines on the EvoCodeBench dataset.

Recent advancements in Large Language Models (LLMs) have transformed code generation from natural language queries. However, despite their extensive knowledge and ability to produce high-quality code, LLMs often struggle with contextual accuracy, particularly in evolving codebases. Current code search and retrieval methods frequently lack robustness in both the quality and contextual relevance of retrieved results, leading to suboptimal code generation. This paper introduces a novel knowledge graph-based approach to improve code search and retrieval leading to better quality of code generation in the context of repository-level tasks. The proposed approach represents code repositories as graphs, capturing structural and relational information for enhanced context-aware code generation. Our framework employs a hybrid approach for code retrieval to improve contextual relevance, track inter-file modular dependencies, generate more robust code and ensure consistency with the existing codebase. We benchmark the proposed approach on the Evolutionary Code Benchmark (EvoCodeBench) dataset, a repository-level code generation benchmark, and demonstrate that our method significantly outperforms the baseline approach. These findings suggest that knowledge graph based code generation could advance robust, context-sensitive coding assistance tools.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes