It's formal verification that works with proofs. Like coq, agda, lean, with which e.g. they proven the Navier-Stokes. This is a new such language.
Assertions and constraint programming is often runtime only. These languages use dependent types and verify the proves at compile time.