GraphLocator: Graph-guided Causal Reasoning for Issue Localization
The issue localization task aims to identify the locations in a software repository that requires modification given a natural language issue description. This task is fundamental yet challenging in automated software engineering due to the semantic gap between issue description and source code implementation. This gap manifests as two mismatches: (1) \emph{symptom–to-cause mismatches}, where descriptions do not explicitly reveal underlying root causes; (2) \emph{one-to-many mismatches}, where a single issue corresponds to multiple interdependent code entities. To address these two mismatches, we propose \emph{GraphLocator}, an LLM-based approach that mitigates symptom–to-cause mismatches through \emph{causal structure discovering} and resolves one-to-many mismatches via \emph{dynamic issue disentangling}. The key artifact of \emph{GraphLocator} is the \emph{causal issue graph} (CIG), in which vertices represent discovered sub-issues along with their associated code entities, and edges encode the causal dependencies between them. The workflow of \emph{GraphLocator} consists of two phases: \emph{symptom vertices locating} and \emph{dynamic CIG discovering}; it first identifies symptom locations on the repository graph, then dynamically expands the CIG by iteratively reasoning over neighboring vertices, discovering new sub-issues and updating causal dependencies. Experiments on three real-world Python and Java datasets demonstrates the effectiveness of \emph{GraphLocator}: (1) Compared with baselines, \emph{GraphLocator} achieves more accurate localization with average improvements of +19.49% in function-level recall and +11.89% in precision with acceptable overhead. (2) \emph{GraphLocator} outperforms baselines on both symptom-to-cause and one-to-many mismatch scenarios, achieving recall improvement of +16.44% and +19.18%, precision improvement of +7.78% and +13.23%, respectively. (3) The disentangled causal structure CIG generated by \emph{GraphLocator} yields the highest relative improvement, resulting in a 28.74% increase in performance on the downstream issue-resolving task.
Tue 7 JulDisplayed time zone: Eastern Time (US & Canada) change
11:00 - 12:30 | Bug Detection and LocalizationIndustry Papers / Journal-First Paper / Research Papers at MB 3.430 Chair(s): Tarannum Shaila Zaman University of Kentucky | ||
11:00 20mTalk | GraphLocator: Graph-guided Causal Reasoning for Issue Localization Research Papers Wei Liu Peking University, Chao Peng Tencent, Pengfei Gao ByteDance, Aofan Liu Peking University, Wei Zhang Peking University, Haiyan Zhao Peking University, Zhi Jin Peking University, Wuhan University | ||
11:20 20mTalk | Reflex: Event-Driven Automated Fault Localization for Large-Scale LLM Training Industry Papers Hua Ding Shanghai Jiao Tong University, Yun Zhang ByteDance Seed, Bo Zhang China Electric Power Research Institute, Wenxiao Wang ByteDance Seed, Libo Chen Shanghai Jiao Tong University, Huan Yu ByteDance Seed, Zhe Nan ByteDance Seed, Zuquan Song ByteDance Seed, Weiqiang Lou ByteDance Seed, Gaohong Liu ByteDance Seed, Xi Yang ByteDance Seed, Yuhan Li ByteDance Seed, Qinlong Wang ByteDance Seed, Shuguang Wang ByteDance Seed, Wencong Xiao ByteDance Seed, Shenghong Li Shanghai Jiao Tong University | ||
11:40 10mTalk | How Far Can VLMs Go for Visual Bug Detection? Studying 19,738 Keyframes from 41 Hours of Gameplay Videos Industry Papers Wentao Lu University of Alberta, Alexander Senchenko Electronic Arts, Alan Sayle Electronic Arts, Abram Hindle University of Alberta, Cor-Paul Bezemer University of Alberta | ||
11:50 20mTalk | Typestate-based Fault Localization of API Usage Violations in a Deep Learning Program Journal-First Paper Fraol Batole Tulane University, Ruchira Manke Tulane University, Robert Dyer University of Nebraska-Lincoln, Tien N. Nguyen University of Texas at Dallas, Hridesh Rajan Tulane University | ||