Jul 2026· Annual International Computer Software and Applications Conference· pp. 2859-2864· 0 citations· 18 references
Computer Science
Abstract
Retrieval-augmented techniques improve automated code repair by grounding generation in external programming knowledge, but most prior approaches assume a static knowledge base. This assumption is problematic in scientific computing, where libraries, APIs, and dependencies evolve continuously. This paper presents RAILS-DK, a dynamic knowledge management framework for retrieval-augmented code repair that treats programming knowledge as an explicit, evolving artifact. RAILS-DK uses a topic-driven registry to control domain-specific APIs and deterministically regenerate documentation and retrieval indices, ensuring verified, environment-aligned, and reproducible repair. We evaluate RAILS-DK on two benchmarks comprising over six hundred compilation- and execution-validated repair instances across Java and Python. The first extends a Java import-resolution benchmark with a synthetic scientific API to isolate knowledge effects from pretrained memorization; the second evaluates execution-level import failures in representative Python scientific kernels. Across both settings, prompt-only and static retrieval fail on unseen or evolving APIs, while RAILS-DK consistently retrieves correct bindings and achieves successful repair, typically within two iterations. These results show that dynamic knowledge management is critical for reliable retrievalaugmented code repair in scientific computing workflows.
This work introduces Executable Code Knowledge (ECK) and defines an Executable Code Knowledge Unit (ECKU) as a source-bound object combining stable identity, semantics, executable behavior, contracts, evidence, relations, provenance, validation state, and a query interface.
RCL (Retrieval-Confidence Layer), a lightweight module inserted between retrieval and generation that combines a call-graph-derived structural coverage score with a novelty score estimating a query's dependence on knowledge outside the model's prior, to detect insufficient retrieval before generation occurs.
Compilable Academic Document Parsing (CADP) is proposed, a paradigm that reconstructs a full page as contextual \LaTeX{} plus executable Python, so that structure-preserving elements and executable chart representations can be reconstructed, recompiled, and directly verified against the source page.
The results suggest that an inspectable semantic bottleneck can improve the coverage and integration of repository-scale migration while enabling lower-cost generation for many repositories.
Shraddha Surana, Ashwin Srinivasan, Michael Bain· 0 citations
This work introduces the Super Library Agent problem, where an agent sequentially generates a portfolio of N related applications while maintaining a shared Super Library of reusable cross-application components, and addresses candidate-guided extraction over code chunk summaries, pre-extraction codebase consolidation,...
Daegyu Sung, Yukyeong Lee, Geon Park et al.· 0 citations
The results indicate that front-loading code understanding into a reusable, codebase-specialised vector store enables small local models to deliver grounded and repository-specific answers, making the agent well suited as a privacy-preserving development tool for in-house scientific codebases.
Aaron Nobile, Andreas Adelmann, Mohsen Sadr· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.