TNODEV: Toolbox for Neural ODE Verification

arXiv:2606.16567 · cs.AI, cs.LG, cs.SY, eess.SY, math.DS · Submitted 2026-06-15 · Read on arXiv

cs.AI, cs.LG, cs.SY, eess.SY, math.DS

Submitted: 2026-06-15

Updated: 2026-10-21

Comments: 44 pages, 10 figures, Accepted in TMLR 2026. Code available at https://github.com/ab-sayed/TNODEV

License: http://creativecommons.org/licenses/by-nc-sa/4.0/

The gist: Neural ordinary differential equations (neural ODE) gained attention in safety critical settings such as continuous-time controllers for cyber-physical systems and classifiers integrated into

Terminology

Abstract

Neural ordinary differential equations (neural ODE) gained attention in safety critical settings such as continuous-time controllers for cyber-physical systems and classifiers integrated into automated decision pipelines, raising the question whether their behavior can be formally verified. Existing tools dedicated to neural ODE provide only a single reachability call without iterative input-set refinement, limiting the precision of their verdicts to whatever one reachability call can deliver. We present TNODEV, the first formal verifier for neural ODE that integrates a falsification checker, a fast interval-based reachability backend based on continuous-time mixed monotonicity, a verification and refinement loop with three input-set splitting heuristics, and a parallel scheduler in a single end-to-end pipeline. TNODEV supports safe-set inclusion verification on pure neural ODE, neural ODE in closed loop with a neural network controller and general neural ODE (GNODE), with the safe set specified either as an interval or as the half-space intersection induced by a target classification label. We evaluate TNODEV on a range of benchmarks across safe-set inclusion and classification-robustness properties, including a direct reachability comparison against NNV 2.0 and CORA and a verification comparison against NNV 2.0 on MNIST general neural ODE classifiers.

Related papers