Newton's Method for omega-Continuous Semirings

Fixed point equations ${\bf\it X} = {\bf\it f}({\bf\it X})$ over?-continuous semirings are a natural mathematicalfoundation of interprocedural program analysis. Generic algorithmsfor solving these equations are based on Kleene's theorem, whichstates that the sequence ${\bf{0}}, {\bf\it f}({\bf{0}}), {\bf\itf}({\bf\it f}({\bf{0}})), \ldots$ converges to the least fixedpoint. However, this approach is often inefficient. We report onrecent work in which we extend Newton's method, the well-knowntechnique from numerical mathematics, to arbitraryω-continuous semirings, and analyze its convergencespeed in the real semiring.

[1]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[2]  Michael Luttenberger,et al.  An Extension of Newton's Method to omega -Continuous Semirings , 2007, Developments in Language Theory.

[3]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[4]  Jozef Gruska.  A Few Remarks on the Index of Context-Free Grammars and Languages , 1971, Inf. Control..

[5]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[6]  Michael Luttenberger,et al.  On Fixed Point Equations over Commutative Semirings , 2007, STACS.

[7]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[8]  J. Esparza,et al.  Model checking probabilistic pushdown automata , 2004, LICS 2004.

[9]  Michael Luttenberger,et al.  Convergence Thresholds of Newton's Method for Monotone Polynomial Equations , 2008, STACS.

[10]  Luca Aceto,et al.  A Fully Equational Proof of Parikh's Theorem , 2001, RAIRO Theor. Informatics Appl..

[11]  Arto Salomaa,et al.  On the Index of a Context-Free Grammar and Language , 1969, Inf. Control..

[12]  Helmut Seidl,et al.  Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations , 2008, ICALP.

[13]  Mary Katherine Yntema,et al.  Inclusion Relations Among Families Of Context-Free Languages , 1967, Inf. Control..

[14]  Michael Luttenberger,et al.  On the convergence of Newton's method for monotone systems of polynomial equations , 2007, STOC '07.

[15]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[16]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[17]  Henning Fernau,et al.  Conditional Context-Free Languages of Finite Index , 1997, New Trends in Formal Languages.

[18]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[19]  Dexter Kozen,et al.  Parikh's theorem in commutative Kleene algebra , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[20]  Michael Luttenberger,et al.  Solving Monotone Polynomial Equations , 2008, IFIP TCS.

[21]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.