Newest papers

Certifying Repeatable Entry-Replay Witnesses for COBOL-to-Java Migration

Andras L. Ferenczi, Mariya Bessonov, Allwyn Ponnudurai, Chandrakanth R. Mamillapalli, Krishna K. Maddula, Krishna Lingamneni · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.27272 · cited by 0 works (OpenAlex) · open-access PDF

Russian

Наше предыдущее исследование, Агентский метод для детерминистской валидации наследственного кода миграции, представляет детерминистский оракул для облегчения таких миграций, Локсмит Лоп. Мы теперь предлагаем новый метод для достижения высокого охвата ветвей и параграфов через генерируемые синтетические кодовые случаи с кодом от кода до кода, с помощью сертификации ввода-перезагрузки, наблюдая след выполнения кода на суррогатном COBOL, который программирует внешние взаимодействия через хронологическую внешнюю операционную ленту. Мы применили наш метод к очень большой программе COBOL с 33,429 линиями кода, чтобы генерировать 849 синтетических кодовых случаев с кодом от кода до кода, охватывающих 2,973/80

Machine translation (Meta M2M100); the English original follows.

Abstract

Producing synthetic data for comparison testing a migrated COBOL application is a major challenge that agentic migrations face today. Our prior paper, the Agentic Method for Deterministic Validation of Legacy Code Migration, presents a deterministic oracle to facilitate such migrations, the Locksmith Loop. We now propose a novel method for achieving high branch and paragraph coverage through generated synthetic end-to-end test cases, by means of entry-replay test-case certification by observing the code execution trace on a surrogate COBOL program that mocks external interactions via a chronological external-operation tape. We applied our method to a very large COBOL program with 33,429 lines of code to generate 849 synthetic end-to-end test cases covering 2,973/3,806 source branches (78.1%) and 989/1,033 main-AST paragraphs (95.7%). Using the Locksmith Loop's projected-agreement validation, the generated Java code matched the COBOL surrogate on the specified observations across all 849 certified synthetic end-to-end test cases. During the campaign we detected 61 defects and fixed the Java generator accordingly. To test whether the coding agent could silently introduce business logic bugs, we seeded 450 defects into the Java code, such as deleted writes, deleted paragraph calls, and altered rounding, to verify how many of these would be detected by the gating methodology. The gate detected 47.6%, including all deleted writes and paragraph calls in executed code, but was unable to detect the rounding and precision defects.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: COBOL, Computer science, Programming language, Java, Code (set theory), Pointer (user interface)

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange