{"id":"hexagon/2611.00152","pdf":"https://hexagonmath.org/pdf/2611.00152v1","url":"https://hexagonmath.org/abs/2611.00152v1","tags":["msc:68Q60","msc:68V15","msc:68V20"],"score":0,"title":"Proof-Carrying Modernization: LLM Translations of COBOL Batch Programs, Each Proved Against the Original in Lean","domain":"cs.LO","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"cs.LO","summary":"Large language models translate legacy code quickly, but a translation can differ from the original on inputs that no test exercises. We show that LLM translations of whole, unmodified COBOL programs into Rust and Java can be proved in Lean 4 to behave like our semantics of the originals on every admissible input: a bounded number of well-formed records, among other premises. The COBOL semantics is executable; it computes record layouts, decimal arithmetic and file handling from our front end’s output for the unmodified source. For the eight standalone batch programs of AWS CardDemo covered…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-11-06","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}