Guiding LLM-based Loop Invariant Synthesis via Feedback on Local Reasoning Errors

May 18, 2026 ยท Grace Period ยท ๐Ÿ› ACM Trans. Program. Lang. Syst. 48, 2, Article 8 (May 2026)

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Tianchi Li, Zhenyu Yan, Junhao Liu, Peng Di, Xin Zhang arXiv ID 2605.17914 Category cs.PL: Programming Languages Citations 0 Venue ACM Trans. Program. Lang. Syst. 48, 2, Article 8 (May 2026)
Abstract
We propose a novel framework that provides constructive feedback to an LLM in the "guess-and-check" paradigm by formally verifying its own thinking process and detecting local reasoning errors. We apply this framework to the loop invariant synthesis problem. We prompt the model to produce a step-by-step natural language proof justifying its thinking process for the failed verification condition of its generated loop invariants. Then, we use an LLM to translate the reasoning steps into first-order logic implications, which can be checked automatically. An invalid implication pinpoints the exact logical flaw in the LLM's thinking process, which we then use to construct targeted feedback for refinement. We have implemented our approach in a tool called LORIS and evaluated it on a main benchmark suite of 460 C programs and an additional benchmark suite of 50 C programs each of which involves non-linear properties. On the main benchmark suite, LORIS solved 445 of the programs, and achieved an overall success rate of $93.1\%$. LORIS also demonstrates robustness on the challenging non-linear benchmark suite.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Programming Languages