3 papers
cs.PL2025
From Affine to Polynomial: Synthesizing Loops with Branches via Algebraic Geometry
Erdenebayar Bayarmagnai, Fatemeh Mohammadi, Rémi Prébet
Ensuring software correctness remains a fundamental challenge in formal program verification. One promising approach relies on finding polynomial invariants for loops. Polynomial i…
cs.SC2025
Beyond Affine Loops: A Geometric Approach to Program Synthesis
Erdenebayar Bayarmagnai, Fatemeh Mohammadi, Rémi Prébet
Ensuring software correctness remains a fundamental challenge in formal program verification. One promising approach relies on finding polynomial invariants for loops. Polynomial i…
cs.SC2024
Algebraic and Algorithmic Methods for Computing Polynomial Loop Invariants
Erdenebayar Bayarmagnai, Fatemeh Mohammadi, Rémi Prébet
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consi…