Example

• A function f mapping a lattice to itself
  f:L → L is monotonic if for all x, y
  
  for example f : BV ³ → BV ³ defined as
  f : (x₁, x₂, x₃) → (x₁, 1, x₃) is monotonic
• Height: it is the length of the longest ascending chain such that there exists
  x₁, x₂, . . . , x_n such that
  
• Monotonicity and finite height ensure that the data-flow algorithms implementing function f terminate
• flow function maps lattice to lattice.
  Flow function for B₁ is given as
  
• Let F_B() be the flow function representing flow through block B and F_p represent the composition of the flow functions encountered in following path p then