Newton ’ s Method for ω-Continuous Semirings ⋆

Fixed point equations X = f (X) overω-continuous semirings are a natural mathematical foundation of interprocedural program analysis . Generic algorithms for solving these equations are based on Kleene’s theorem, wh ich states that the sequence 0, f (0), f (f (0)), . . . converges to the least fixed point. However, this approach is often inefficient. We… CONTINUE READING