ACL2 is both a programming language in which you can model computer systems and a tool to help proving properties of those models.

Each corresponds to a mathematical model that can be used to prove properties of higher level algorithms, such as CBC.

Induction can also be used to prove properties about a sequence, especially for sequences whose most natural specification is by recursion.

The Dolev-Yao model is a formal model used to prove properties of interactive protocols.

Lacking this, it is then impossible to use the axioms to manipulate the polynomial and prove true properties about it.

For some approximation algorithms it is possible to prove certain properties about the approximation of the optimum result.

Software model checking is the algorithmic analysis of programs to prove properties of their executions.

Abstraction attempts to prove properties on a system by first simplifying it.

The basic applications of mollifiers is to prove properties valid for smooth functions also in nonsmooth situations:

While these analyses prove properties of programs that are valuable for DSU, they are by nature sophisticated and difficult to understand.