Richer types of invariant

Object/class invariants

node.left.value < node.right.value

string.data[string.length] = ’\0’

Pointers (recursive data structures)

tree is sorted

Conditionals

if proc.priority < 0 then proc.status = active

ptr = null or *ptr > i

Previous slide

Next slide

Back to first slide

View graphic version