Arbitrary Change

• Arbitrary change = deletion + addition.
• We can use the previous algorithms.
• We have to compute two fixpoints.
• Revision may not involve very far reaching changes while the deletion and addition together do.
• Top-down and bottom-up deletion algorithms can handle arbitrary change with only minor modification.
• Enough analysis information must be removed to ensure correctness.
• Useful for ``Test-Debug cycle''.