Abstract
Fixed point equations over X = f(X) ω-continuous semirings are a natural mathematical foundation of interprocedural program analysis. Generic algorithms for solving these equations are based on Kleene's theorem, which states that the sequence 0, f(0), f(f(0)),... converges to the least fixed point. However, this approach is often inefficient. We report on recent work in which we extend Newton's method, the well-known technique from numerical mathematics, to arbitrary ω-continuous semirings, and analyze its convergence speed in the real semiring. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Esparza, J., Kiefer, S., & Luttenberger, M. (2008). Newton’s method for ω-continuous semirings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 14–26). https://doi.org/10.1007/978-3-540-70583-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
