Skip to main content
Search

Rongkang Li

1 related articles

Subscribe to updates
  1. arXiv

    Loop termination proofs stop relying on templates alone: RAINFALL has an LLM fill assertions and solves 323 of 358 C programs

    Proving loop termination usually means hand-designing ranking-function templates, and a poor template choice struggles with nonlinear updates and complex control flow. RAINFALL recasts ranking-function synthesis as code-assertion completion: four placeholder slots are inserted into the program, an LLM fills them, a symbolic verifier checks the result, and diagnostics from failed checks are fed back for iterative refinement. On 358 terminating C programs, RAINFALL with MiniMax V2.7 synthesized verifiable ranking functions for 323 programs (90.22%), 12 more than PROTON 2.1, the SV-COMP 2026 Termination category winner; combined, the two reach 346 programs (96.65%).

You’re all caught up