ICLM 2026 Conference
Spotlight on Ido Pinto’s poster at ICLM 2026ย
A few days ago, Ido Pinto from The Hebrew University of Jerusalem presented his poster and discussed his paper – co-authored with Yizhak Elboher , Andrew Wu, Nina Narodytska, and Guy Katz – titled “๐ก๐ผ๐ ๐๐น๐น ๐๐ป๐๐ฎ๐ฟ๐ถ๐ฎ๐ป๐๐ ๐๐ฟ๐ฒ ๐๐พ๐๐ฎ๐น: ๐๐๐ฟ๐ฎ๐๐ถ๐ป๐ด ๐ง๐ฟ๐ฎ๐ถ๐ป๐ถ๐ป๐ด ๐๐ฎ๐๐ฎ ๐๐ผ ๐๐ฐ๐ฐ๐ฒ๐น๐ฒ๐ฟ๐ฎ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ ๐ฉ๐ฒ๐ฟ๐ถ๐ณ๐ถ๐ฐ๐ฎ๐๐ถ๐ผ๐ป ๐๐ถ๐๐ต ๐ฆ๐๐ ๐” at CML2026 (Forty-Third International Conference on Machine Learning) in South Korea.
๐๐ฒ๐ฟ๐ฒโ๐ ๐ฎ ๐พ๐๐ถ๐ฐ๐ธ ๐๐๐บ๐บ๐ฎ๐ฟ๐ ๐ผ๐ณ ๐๐ต๐ฒ๐ถ๐ฟ ๐๐ผ๐ฟ๐ธ
Program verification mathematically guarantees that software behaves correctly, which is essential for safety-critical systems where a single bug can be catastrophic. It often depends on loop invariants, propertiesย that hold on every iteration of a loop, and discovering them automatically has been a bottleneck for decades.
We introduce WONDA, a data curation pipeline for loop invariant generation that turns raw, verbose invariants from symbolic verifiers into compact, high-quality training data, formally verifying every candidate so it remains provably correct and useful.
Fine-tuning small models on this curated data yields consistent gains across the Qwen3, Llama-3.1, and Mistral families.
Most strikingly, a 4B model outperforms an 80B, and a 14B matches GPT-5.2 on end-to-end verification time.
This shows that careful data curation lets small models compete with much larger ones, a practical step toward efficient LLM-assisted verification.




