Security via Type Qualifiers
Jeff Foster     U Maryland

Solving Constraints
  - O(n)

Parametric Polymorphism
  - O(n(^8))

CFL Reachability (Horwitz, Reps, Sagiv, and
Rehof, Fahndrich and Das)

  - a better solution to get parametric polymophism
  - O(n^3)

Reference
  Rehof, Fahndrich, POPL 01

