Common requirement

Analyses must be sound (conservative)
Examples
- A type inferencing algorithm shouldn’t improperly identify the type of an expression
  - Incompleteness is acceptable
- A compiler should never misidentify common subexpressions
  - Might get incorrect target code