Geometric numerical integrators are key algorithms for simulating differential equations, used routinely across science and engineering. They approximate the evolution of a dynamical system while preserving geometric structure, i.e., \emph{differential forms}, ensuring simulations remain physically faithful over long time horizons. Yet, establishing that a given integrator actually preserves the underlying geometric structure is subtle and error-prone. Today, these proofs are carried out largely by hand by experts, a task made challenging by the programs’ complex structure.
We present SymPL, the first Hoare-style program logic for verifying the geometric invariants of numerical integrators, where assertions are differential forms and proof rules reason about how a program modifies them. SymPL formalizes calls to implicit equation solvers, which are central to many geometric integrators. We further develop SymPLERR, a quantitative extension that tracks how far a program drifts from preserving a differential form when an implicit equation solver cannot compute the solution to the equation exactly. Finally, we implement SymPLEST, an automated verifier for SymPL, and use it to verify geometric properties for a suite of integrators.