Well-founded orders and termination proofs. Use ranking functions to prove liveness properties and show that every execution path eventually reaches a goal state.
Part of Mathematical Foundations of Model Checking on formal.org.