Formal verification is a method of checking software by proving, with mathematical logic, that it satisfies a precise specification under all possible inputs. Engineers first write the intended behaviour as formal properties, for example that the total supply of a token never changes except through minting, or that no user can withdraw more than they deposited. Tools such as theorem provers, model checkers and symbolic execution engines then try to prove each property or find a counterexample.
For a smart contract, which usually cannot be changed after deployment and may hold large sums, formal proofs give stronger assurance than testing. A normal smart contract audit relies on expert review and tests, which can miss rare cases. Verification is slow and costly, and it proves only what the specification says: a wrong or incomplete specification leaves bugs uncaught. Some platforms, such as Cardano with languages like Haskell, have been designed with verification in mind.
Ref 1070001181