Lecture 06: Abstract Interpretation Background
Control-Flow Graphs and While Theorem: How to convert a program to have a single loop. What does this mean about invariants?
Loop invariant inference over a restricted set of invariants. Need for approximation.
Partial Orders for Approximation
Continued in Lecture 07