Examples:

• Conjunctions of Predicates - example of finite lattice. two different orders
• Constant Propagation - infinite lattice with finite ascending chain property
• Bitwidth analysis
• Interval analysis
• Polyhedra - linear inequalities
• Converging in Infinite-Height Lattice - dropping conjuncts

Designing Abstract Domains

Approximation Expressed Using Formulas

• A Tutorial on Abstract Interpretation by Patrick Cousot, also local pdf copy
• Calculus of Computation Textbook Chapter 12, including Section 12.4
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints (original abstract interpretation paper)
• Lecture notes on static analysis by Michael Schwartzbach (sections 4,5,6,7 in particular)
• Notes on program analysis, by Alex Aiken
• Patrick Cousot's MIT Class
• PA 2005 at Tel-Aviv University
• Lecture on ASTREE

Conferences:

• Symposium on Principles of Programming Languages (POPL)
• SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
• Static Analysis Symposium (SAS)
• Verification, Model Checking and Abstract Interpretation (VMCAI)