Diluted Path Sensitivity

Information is diluted by merge operator

non-distributed problems

Distributed formulations of non-distributed problems - constant propagation

[Sagiv, Reps, Horwitz, TCS’96] -

• exploded labeled super graph - linear constant propagation

[Bodik & Anik, POPL’98] -

• value name graph - non-linear constant propagation

Partial: optimization on some paths

Previous slide

Next slide

Back to first slide

View graphic version