Authors :
Syed Musadiq Illahi; Sankalp Shankar; Surabhi Singh; Pravith S. Upadhyaya; Abhishek Kumar
Volume/Issue :
Volume 11 - 2026, Issue 10 - October
Google Scholar :
https://tinyurl.com/4e3vr5ua
DOI :
https://doi.org/10.38124/ijisrt/26Oct385
Note : A published paper may take 4-5
working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and
ResearchGate.
Abstract :
Background: Legacy code modernization is no longer about just translating one file into another language. Real software repositories contain dependencies between files and external services, hidden assumptions, and tests that must continue to work after migration. These repository-level relationships make modernization much harder of a task than simple code translation. Objective: This paper reviews graph-aware, recursive, and neuro-symbolic approaches for legacy modernization and examines how well they perform when applied to real-world software repositories. Methods: We reviewed English-language studies indexed in IEEE Xplore, the ACM Digital Library, and arXiv from January 2020 to April 2026, focusing on repositorylevel code translation, refactoring, and validation. Results: There are three recurring patterns. High-level repository understanding is enhanced by graph-based representations. LLMs can operate beyond a single context window thanks to recursive orchestration and when executability and contract preservation truly matter, pure generative techniques are outperformed by validation-heavy pipelines such as AlphaTrans and TRAM. Benchmark gains are not the same as deployment-ready because often benchmark suites underrepresent runtime variability, validation is costly, and graph extraction is frequently incomplete, failing to account for undocumented assumptions. Conclusions: No single approach solves everything. The conclusion is that all three layers—graph structure, orchestration technique, and deterministic checking— must be combined.
Keywords :
Legacy Modernization, Neuro-Symbolic AI, Graph Neural Networks, Recursive Language Models, Code Translation, Software Engineering.
References :
- X. Chen, J. Xue, X. Xie, C. Liang, and X. Ju, “A systematic literature review on neural code translation,” arXiv preprint arXiv:2505.07425, 2025.
- Y. Pan, J. Zhao, C. Wang, and Q. Liu, “Repotransbench: A realworld benchmark for repository-level code translation,” arXiv preprint arXiv:2412.17744, 2024.
- Y. Xu, J. Yang, and T.-H. Chen, “SWE-refactor: A repository-level benchmark for real-world LLM-based code refactoring,” arXiv preprint arXiv:2602.03712, 2026.
- R. Bairi, A. Sonwane, A. Kanade, S. Iyer, S. Parthasarathy, S. Rajamani, B. Ashok, and S. Shet, “Codeplan: Repository-level coding using LLMs and planning,” in International Conference on Learning Representations (ICLR), 2024. [Online]. Available: https://openreview.net/forum?id=d0A2pc2kFp
- S. Ouyang, W. Yu, K. Ma, Z. Xiao, Z. Zhang, M. Jia, J. Han, H. Zhang, and D. Yu, “Repograph: Enhancing AI software engineering with repository-level code graph,” in International Conference on Learning Representations (ICLR), 2025. [Online]. Available: https: //openreview.net/forum?id=dw9VUsSHGB
- A. R. Ibrahimzada, K. Ke, M. Pawagi, M. S. Abid, R. Pan, S. Sinha, and R. Jabbarvand, “Repository-level compositional code translation and validation,” arXiv preprint arXiv:2410.24117, 2024.
- Z. Feng, D. Guo, D. Tang, N. Duan, X. Feng, M. Gong, L. Shou, B. Qin, T. Liu, D. Jiang, and M. Zhou, “CodeBERT: A pre-trained model for programming and natural languages,” in Findings of the Association for Computational Linguistics: EMNLP 2020, 2020, pp. 1536–1547.
- D. Guo, S. Ren, S. Lu, Z. Feng, D. Tang, S. Liu, L. Zhou, N. Duan, A. Svyatkovskiy, S. Fu, M. Tufano, S. Deng, C. Clement, D. Drain, N. Sundaresan, J. Yin, D. Jiang, and M. Zhou, “Graphcodebert: Pretraining code representations with data flow,” in International Conference on Learning Representations, 2021.
- W. Ahmad, S. Chakraborty, B. Ray, and K.-W. Chang, “PLBART: Unified pre-training for program understanding and generation,” in North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021, pp. 2113–2125.
- Y. Wang, W. Wang, S. Joty, and S. C. Hoi, “CodeT5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation,” in Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021, pp. 8696–8708.
- D. Guo, S. Lu, N. Duan, L. Shou, M. Gong, and D. Jiang, “UniXcoder: Unified cross-modal pre-training for code representation,” arXiv preprint arXiv:2203.03850, 2022.
- M. Chen, J. Tworek, H. Jun, Q. Yuan, H. P. d. O. Pinto, J. Kaplan, H. Edwards, Y. Burda, N. Joseph, G. Brockman, A. Ray, R. Puri, G. Krueger, M. Petrov, H. Khlaaf, G. Sastry, P. Mishkin, B. Chan, S. Gray, N. Ryder, M. Pavlov, A. Power, L. Kaiser, M. Bavarian, C. Winter, P. Tillet, F. P. Such, D. Cummings, M. Plappert, F. Chantzis, E. Barnes, A. Herbert-Voss, W. H. Guss, A. Nichol, A. Paino, N. Tezak, J. Tang, I. Babuschkin, S. Balaji, S. Jain, W. Saunders, C. Hesse, A. N. Carr, J. Leike, J. Achiam, V. Misra, E. Morikawa, A. Radford, M. Knight, M. Brundage, M. Murati, K. Mayer, P. Welinder, B. McGrew, D. Amodei, G. Mishra, I. Sutskever et al., “Evaluating large language models trained on code,” arXiv preprint arXiv:2107.03374, 2021.
- D. Fried, A. Aghajanyan, J. Lin, S. I. Zhu, U. Alon, W. Choi, M. Chen, X. Hao, W. Y. Wang, K. Cho et al., “InCoder: A generative model for code infilling and synthesis,” International Conference on Learning Representations, 2023.
- R. Li, L. B. Allal, Y. Zi, N. Muennighoff, D. Kocetkov, C. Mou, M. Marone, C. Akiki, J. Li, J. Chim et al., “Starcoder: May the source be with you!” Transactions on Machine Learning Research, 2023.
- Y. Li, D. Choi, J. Chung, N. Kushman, J. Schrittwieser, R. Leblond, T. Eccles, J. Keeling, F. Gimeno, A. Dal Lago et al., “Competitionlevel code generation with AlphaCode,” Science, vol. 378, no. 6624, pp. 1092–1097, 2022.
- B. Roziere, J. Gehring, F. Gloeckle, S. Sootla, I. Gat, X. E. Tan, Y. Adi, J. Liu, T. Remez, J. Rapin, A. Kozhevnikov, I. Evtimov, J. Wang, P. G. Sessa, M. Caccia, Y. Bitton, M. Eliav, M. Khalifa, J. M. Rehg et al., “Code llama: Open foundation models for code,” arXiv preprint arXiv:2308.12950, 2023.
- S. Lu, D. Guo, S. Ren, J. Huang, A. Svyatkovskiy, A. Blanco, C. Clement, D. Drain, D. Jiang, D. Tang, G. Li, L. Zhou, L. Shou, L. Zhou, M. Tufano, M. Gong, M. Zhou, and N. Duan, “CodeXGLUE: A machine learning benchmark dataset for code understanding and generation,” in Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track, 2021.
- C. E. Jimenez, J. Yang, A. Wettig, K. Lieret, S. Yao, K. Pei, O. Press, and J. Narasimhan, “SWE-bench: Can language models resolve real-world GitHub issues?” International Conference on Learning Representations, 2024.
- M. J. Page, J. E. McKenzie, P. M. Bossuyt, I. Boutron, T. C. Hoffmann, C. D. Mulrow, L. Shamseer, J. M. Tetzlaff, E. A. Akl, S. E. Brennan, R. Chou, J. Glanville, J. M. Grimshaw, A. Hrobjartsson, M. M. Lalu, T. Li, E. W. Loder, E. Mayo-Wilson, S. McDonald, L. A. McGuinness, J. A. Stewart, J. Thomas, A. C. Tricco, V. A. Welch, P. Whiting, and D. Moher, “The PRISMA 2020 statement: An updated guideline for reporting systematic reviews,” BMJ, vol. 372, p. n71, 2021.
- J. Ferrante, K. J. Ottenstein, and J. D. Warren, “The program de-pendence graph and its use in optimization,” in Proceedings of the 11th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1984, pp. 298–305.
- S. Horwitz, T. Reps, and D. Binkley, “Interprocedural slicing using dependence graphs,” ACM Transactions on Programming Languages and Systems, vol. 12, no. 1, pp. 26–60, 1990.
- R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, “Efficiently computing static single assignment form and the control dependence graph,” ACM Transactions on Programming Languages and Systems, vol. 13, no. 4, pp. 451–490, 1991.
- J. Dean, D. Grove, and C. Chambers, “Optimization of object-oriented programs using static class hierarchy analysis,” in Proceedings of the 9th European Conference on Object-Oriented Programming, 1995, pp. 77– 101.
- D. F. Bacon and P. F. Sweeney, “Fast static analysis of C++ virtual function calls,” in Proceedings of the 11th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, 1996, pp. 324–341.
- T. Reps, S. Horwitz, and M. Sagiv, “Precise interprocedural dataflow analysis via graph reachability,” Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 49–61, 1995.
- R. Vallée-Rai, P. Co, E. Gagnon, L. Hendren, P. Lam, and V. Sundaresan, “Soot – a java bytecode optimization framework,” in Proceedings of the 1999 Conference of the Centre for Advanced Studies on Collaborative Research, 1999, p. 13.
- F. Yamaguchi, N. Golde, D. Arp, and K. Rieck, “Modeling and discovering vulnerabilities with code property graphs,” in 2014 IEEE Symposium on Security and Privacy, 2014, pp. 590–604.
- H. Tao, Y. Zhang, Z. Tang, H. Peng, X. Zhu, B. Liu, Y. Yang, Z. Zhang, Z. Xu, H. Zhang, L. Zhu, R. Wang, H. Yu, J. Li, and P. Di, “Code graph model (CGM): A graph-integrated large language model for repositorylevel software engineering tasks,” arXiv preprint arXiv:2505.16901, 2025.
- L. Kong, J. Feng, H. Liu, C. Huang, J. Huang, Y. Chen, and M. Zhang, “GOFA: A generative one-for-all model for joint graph language modeling,” arXiv preprint arXiv:2407.09709, 2024.
- S. Froimovich, R. Gal, W. Ibraheem, and A. Ziv, “Quality evaluation of COBOL to Java code transformation,” arXiv preprint arXiv:2507.23356, 2025.
- W. Zhang, C. Zhang, Z. Luo, J. Ma, W. Yuan, C. Gu, and C. Feng, “Semanticforge: Repository-level code generation through semantic knowledge graphs and constraint satisfaction,” arXiv preprint arXiv:2511.07584, 2025.
- A. Zhang, S. Karp, N. Setlur, H. Wang, N. Malkin, T. Hashimoto, and C. Tomlin, “Recursive language models,” arXiv preprint arXiv:2512.24601, 2025.
- K. Ke, A. R. Ibrahimzada, R. Pan, S. Sinha, and R. Jabbarvand, “Advancing automated in-isolation validation in repository-level code translation,” arXiv preprint arXiv:2511.21878, 2025.
- A. R. Ibrahimzada, B. Paulsen, R. Jabbarvand, J. Dodds, and D. Kroening, “Matchfixagent: Language-agnostic autonomous repository-level code translation validation and repair,” arXiv preprint arXiv:2509.16187, 2025.
- X. Li, N. Ben-Israel, Y. Raz, B. Ahmed, D. Serebro, and A. Raux, “Repomod-bench: A benchmark for code repository modernization via implementation-agnostic testing,” arXiv preprint arXiv:2602.22518, 2026.
Background: Legacy code modernization is no longer about just translating one file into another language. Real software repositories contain dependencies between files and external services, hidden assumptions, and tests that must continue to work after migration. These repository-level relationships make modernization much harder of a task than simple code translation. Objective: This paper reviews graph-aware, recursive, and neuro-symbolic approaches for legacy modernization and examines how well they perform when applied to real-world software repositories. Methods: We reviewed English-language studies indexed in IEEE Xplore, the ACM Digital Library, and arXiv from January 2020 to April 2026, focusing on repositorylevel code translation, refactoring, and validation. Results: There are three recurring patterns. High-level repository understanding is enhanced by graph-based representations. LLMs can operate beyond a single context window thanks to recursive orchestration and when executability and contract preservation truly matter, pure generative techniques are outperformed by validation-heavy pipelines such as AlphaTrans and TRAM. Benchmark gains are not the same as deployment-ready because often benchmark suites underrepresent runtime variability, validation is costly, and graph extraction is frequently incomplete, failing to account for undocumented assumptions. Conclusions: No single approach solves everything. The conclusion is that all three layers—graph structure, orchestration technique, and deterministic checking— must be combined.
Keywords :
Legacy Modernization, Neuro-Symbolic AI, Graph Neural Networks, Recursive Language Models, Code Translation, Software Engineering.