Lattices for Abstract Interpretation

This lecture introduces lattices as a fundamental concept for abstract interpretation, focusing on updating sets through iterations, fixpoint analysis, automatically constructed Hoare logic proof, and the big picture of abstract interpretation. It covers abstract domains, partial orders, Hasse diagrams, extreme elements, least upper bound, greatest lower bound, and exercises on finding lub and glb. The lecture also discusses constructing orders using inverse images, lattices, examples of lattices, and products of lattices.