Identifying Latent Declarative Representations of Code for Assisting Repository Migration
Source
arxiv.org
Author
Shraddha Surana, Ashwin Srinivasan, Michael Bain
Date
Why it matters
Repository-scale porting gets tractable when the program's implicit specification is made explicit first — and f2x50 gives a 50-repo Fortran benchmarkA standard public test set for comparing AI models — the shared scoreboards behind every "model X beats model Y" claim.Full definition → for measuring whether a port actually preserved behavior.
Terms in this piece · Glossary
LLM — A large language model — the neural network behind tools like Claude and ChatGPT, trained on huge amounts of text to predict what comes next.
chunking — Splitting documents into passages small enough to embed and retrieve individually — the step that quietly determines whether retrieval works at all.
benchmark — A standard public test set for comparing AI models — the shared scoreboards behind every "model X beats model Y" claim.
articleDepWareTrans: Dependency-Aware Incremental Repository Migration across Co-executable LanguagesSivajeet Chand, Alexander Pretschner, Steve Haupt, Derui Zhu, Sushant Kumar Pandey
articleTemporal Validity on Real Software Histories: Eliminating Stale-Fact Errors in Code-Assistant Memory over GitHub FixesNeeraj Yadav
articleLegacy System Modernization with Coding Agents: A Case StudyIago da Silva Rodrigues Alves, Cristiano Politowski, Jo\~ao Eduardo Montandon