Skip to content
Book Open access

EffiHolmes: Differential Profiling-Guided Repository Level Time Inefficiency Fix Localization

Aug 2026 · Proceedings of the 41st IEEE/ACM International Conference on Automated Software Engineering · 1 citation · 75 references
Computer Science

TL;DR

EffiHolmes is an LLM-based frame- work for localizing fix locations of repository-level time inefficiency issues, which outperforms state-of-the-art retrieval-based, agent-based, and profiling-based baselines and remains robust across model capacities.

Abstract

Large software systems often suffer from time inefficiencies, leading to excessive execution time despite functional correctness. Local- izing the fix locations of such inefficiency issues is notoriously difficult. Applying existing fault localization paradigms to this task presents significant challenges. Unlike functional bugs, time ineffi- ciencies do not cause crashes or test failures. They therefore provide neither binary oracles nor stack-trace localization clues, making traditional fault localization and recent LLM-based methods not ap- plicable. While runtime profiling provides alternative clues, it faces some challenges in repository-level settings. Single-run profiling is non-discriminative, failing to distinguish inefficiency hotspots (i.e., time-consuming functions) from execution noise. Furthermore, existing profilers struggle to extract the execution paths relevant to inefficiency from the vast background execution. Crucially, even with the extracted execution paths, a semantic gap still persists between the observed inefficiency and where to fix. In this paper, we propose EffiHolmes, an LLM-based frame- work for localizing fix locations of repository-level time inefficiency issues. First, it employs differential profiling (default vs. scaled workloads) to pinpoint inefficiency hotspots. Second, to extract the execution paths relevant to inefficiency, it performs execution path extraction, constructing compact execution paths that connect hotspots to the reported inefficient function. Third, to bridge the gap between the hotspots and fix locations, it employs guided LLM reasoning with domain heuristics to locate the inefficiency logic. To facilitate the evaluation, we introduce RepoEffi-Bench, the first benchmark for repository-level inefficiency localization, consisting of 140 high-quality time inefficiency issues collected from popular Python repositories. The results show that EffiHolmes consis- tently outperforms state-of-the-art retrieval-based, agent-based, and profiling-based baselines, with gains of 4.29 pp on GPT-5.1 file- level Acc@3 and 15.00 pp on qwen3-4b function-level Acc@5 over the best baseline. It also remains robust across model capacities.

Read PDF

Similar papers

Book Open access Sep 2026

LMTracer: Fine-Grained and Real-Time Performance Profiling for Production LLM Systems

LMTracer is presented, a fine-grained and real-time performance profiling framework for production LLM services that embed profiling logic into the execution through graph-embedded probing and streaming buffered profiling data to CPUs on demand to keep the execution of user kernels uninterrupted.

Wei Liu, Yong-Chao He, Bo-Han Zhao et al. · 0 citations
Sep 2026

InterFuse: Scalable Detection of Memory Safety Violations via Differential Reasoning and Hierarchical Context Fusion

This work proposes InterFuse, a framework for differential path reasoning that builds compact interprocedural control-flow graphs with targeted pruning, samples high-contrast paths via genetic optimization, and uses hierarchical fusion with a lightweight concatenation-based module to enhance discriminative signals.

Yao Zhang, Rui-Jie Cai, Xiao-Kang Yin et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Probing the Prefill: Detecting Code Vulnerabilities via Latent Activations

LLM-based code generation is now embedded in mission-critical pipelines, but defenses against vulnerable output remain post-hoc -- static analyzers, fine-tuned classifiers, or an LLM judge that screen completed code, ignoring the generating model's own internal state. We test a narrower, directly measurable question: w...

Alizishaan Khatri · 0 citations
Open access Oct 2026

E2WR: An Effective and Efficient Reduction Framework for WebAssembly Binaries

WebAssembly (Wasm) is a prominent programming language enabling high-performance execution across diverse computing environments. However, bugs in Wasm runtimes, which execute Wasm binaries, can lead to severe security breaches and system failures. Manually debugging Wasm binaries that trigger such runtime bugs is exce...

Shi-Yao Zhou, Ning-Yu He, David Lo et al. · 0 citations
Book Open access Oct 2026

PR2Trigger: From Concurrency-Fix PR Diffs to Executable Triggering Tests for Go

Public PRs and CVE advisories are valuable sources for Go concurrency-bug research, but rarely provide executable benchmark samples because historical projects are difficult to rebuild and many fixes lack reusable triggering tests. We present PR2Trigger, a semi-automated pipeline that reconstructs PR-localized triggeri...

Risheng Wei, Yu-Heng Shen, Yi-Ming Ye et al. · 0 citations
Book Open access Oct 2026

Stop When It Matters: Detectability-Guided Microbenchmarking for Performance Regression Testing

Performance microbenchmarks are widely used for detecting performance regressions in continuous integration, yet existing execution policies remain computationally expensive. We present detectability-guided microbenchmarking, a principled framework that reformulates benchmark execution as a Minimum-Detectable-Effect (M...

Zong-Xiong Chen, De-Rui Zhu, Jin-Fu Chen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.