{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:59:41Z","timestamp":1742939981044,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_11","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"181-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Newton\u2019s Method \u2013 There and\u00a0Back Again"],"prefix":"10.1007","author":[{"given":"Michael","family":"Luttenberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Schlund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0028754","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"1998","unstructured":"Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 305\u2013318. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028754"},{"doi-asserted-by":"publisher","unstructured":"Boigelot, B.: On iterating linear transformations over recognizable sets of integers. English. Theor. Comput. Sci. 309, 1\u20133 (2003). ISSN: 0304\u20133975. https:\/\/doi.org\/10.1016\/S0304-3975(03)00314-1","key":"11_CR2","DOI":"10.1016\/S0304-3975(03)00314-1"},{"doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A.W., Winkowski, J. (eds.) CONCUR 1997: Concurrency Theory, 8th International Conference, Warsaw, Poland, 1\u20134 July 1997, Proceedings. LNCS, vol. 1243, pp. 135\u2013150. Springer, Cham (1997). https:\/\/doi.org\/10.1007\/3-540-63141-0_10","key":"11_CR3","DOI":"10.1007\/3-540-63141-0_10"},{"doi-asserted-by":"publisher","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Syst. 32(1), 1\u201333 (1999). https:\/\/doi.org\/10.1007\/s002240000110","key":"11_CR4","DOI":"10.1007\/s002240000110"},{"doi-asserted-by":"publisher","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages*. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems. Studies in Logic and the Foundations of Mathematics, vol. 35, pp. 118\u2013161. Elsevier (1963). https:\/\/doi.org\/10.1016\/S0049-237X(08)72023-8","key":"11_CR5","DOI":"10.1016\/S0049-237X(08)72023-8"},{"unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall Mathematics Series. Dover Publications, Incorporated, London (2012). ISBN: 9780486485836","key":"11_CR6"},{"key":"11_CR7","first-page":"178","volume":"44","author":"B Courcelle","year":"1991","unstructured":"Courcelle, B.: On constructing obstruction sets of words. Bull. EATCS 44, 178\u2013186 (1991)","journal-title":"Bull. EATCS"},{"doi-asserted-by":"publisher","unstructured":"Deutch, D., et al.: Circuits for datalog provenance. In: Proceedings of 17th International Conference on Database Theory (ICDT), Athens, Greece, 24\u201328 March 2014, pp. 201\u2013212 (2014). https:\/\/doi.org\/10.5441\/002\/icdt.2014.22","key":"11_CR8","DOI":"10.5441\/002\/icdt.2014.22"},{"doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W.: Handbook of Weighted Automata. In: Vogler, H., Droste, M., Kuich, W. (eds.) Chap. 1: Semirings and Formal Power Series, vol. 1, pp. 3\u201327. Springer, Cham (2009)","key":"11_CR9","DOI":"10.1007\/978-3-642-01492-5_1"},{"doi-asserted-by":"publisher","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Cham (2009). ISBN: 3642014917, https:\/\/doi.org\/10.1007\/978-3-642-01492-5","key":"11_CR10","DOI":"10.1007\/978-3-642-01492-5"},{"doi-asserted-by":"publisher","unstructured":"Ershov, A.P.: On programming of arithmetic operations. Commun. ACM 1(8), 3\u20139 (1958). https:\/\/doi.org\/10.1145\/368892.368907","key":"11_CR11","DOI":"10.1145\/368892.368907"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Etessami, K.: Verifying probabilistic procedural programs. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, 16\u201318 December 2004, Proceedings. LNCS, vol. 3328, pp. 16\u201331. Springer, Cham (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_2","key":"11_CR12","DOI":"10.1007\/978-3-540-30538-5_2"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: An extension of Newton\u2019s method to Omega-continuous semirings. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, 3\u20136 July 2007, Proceedings. LNCS, vol. 4588, pp. 157\u2013168. Springer, Cham (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_17","key":"11_CR13","DOI":"10.1007\/978-3-540-73208-2_17"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Computing the least fixed point of positive polynomial systems. SIAM J. Comput. 39(6), 2282\u20132335 (2010). https:\/\/doi.org\/10.1137\/090749591","key":"11_CR14","DOI":"10.1137\/090749591"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newtonian program analysis. J. ACM 57(6), 33:1\u201333:47 (2010). https:\/\/doi.org\/10.1145\/1857914.1857917","key":"11_CR15","DOI":"10.1145\/1857914.1857917"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. 412(28), 3226\u20133241 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.03.020","key":"11_CR16","DOI":"10.1016\/j.tcs.2011.03.020"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14\u201317 July 2004, Turku, Finland, Proceedings, pp. 12\u201321. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/LICS.2004.1319596","key":"11_CR17","DOI":"10.1109\/LICS.2004.1319596"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Kucera, A., Schwoon, S.: Model-checking LTL with regular valuations for pushdown systems. In: Kobayashi, N., Pierce, B.C. (eds.) Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, 29\u201331 October 2001, Proceedings. LNCS, vol. 2215, pp. 316\u2013339. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/3-540-45500-0_16","key":"11_CR18","DOI":"10.1007\/3-540-45500-0_16"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Luttenberger, M., Schlund, M.: A brief history of Strahler numbers. In: Dediu, A.-H., et al. (eds.) Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, 10\u201314 March 2014. Proceedings. LNCS, vol. 8370, pp. 1\u201313. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04921-2_1","key":"11_CR19","DOI":"10.1007\/978-3-319-04921-2_1"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, 18\u201322 July 2001, Proceedings. LNCS, vol. 2102, pp. 324\u2013336. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_30","key":"11_CR20","DOI":"10.1007\/3-540-44585-4_30"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., et al.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, 15\u201319 July 2000, Proceedings. LNCS, vol. 1855, pp. 232\u2013247. Springer, Cham (2000). https:\/\/doi.org\/10.1007\/10722167_20","key":"11_CR21","DOI":"10.1007\/10722167_20"},{"doi-asserted-by":"publisher","unstructured":"Esparza, J., et al.: Approximative methods for monotone systems of min-max-polynomial equations. In: Aceto, L., et al. (eds.) Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, 7\u201311 July 2008, Proceedings, Part I: Track A: Algorithms, Automata, Complexity, and Games. LNCS, vol. 5125, pp. 698\u2013710. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_57","key":"11_CR22","DOI":"10.1007\/978-3-540-70575-8_57"},{"doi-asserted-by":"publisher","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: Diekert, V., Durand, B. (eds.) STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 24\u201326 February 2005, Proceedings. LNCS, vol. 3404, pp. 340\u2013352. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/978-3-540-31856-9_28","key":"11_CR23","DOI":"10.1007\/978-3-540-31856-9_28"},{"doi-asserted-by":"publisher","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4612-4054-9","key":"11_CR24","DOI":"10.1007\/978-1-4612-4054-9"},{"doi-asserted-by":"publisher","unstructured":"Ginsburg, S., Spanier, E.H.: Derivation-bounded languages. J. Comput. Syst. Sci. 2(3), 228\u2013250 (1968). https:\/\/doi.org\/10.1016\/S0022-0000(68)80009-1","key":"11_CR25","DOI":"10.1016\/S0022-0000(68)80009-1"},{"doi-asserted-by":"crossref","unstructured":"Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: PODS, pp. 31\u201340 (2007)","key":"11_CR26","DOI":"10.1145\/1265530.1265535"},{"doi-asserted-by":"publisher","unstructured":"Hopkins, M.W., Kozen, D.C.: Parikh\u2019s theorem in commutative Kleene algebra. In: Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp. 394\u2013401 (1999). https:\/\/doi.org\/10.1109\/LICS.1999.782634","key":"11_CR27","DOI":"10.1109\/LICS.1999.782634"},{"doi-asserted-by":"publisher","unstructured":"Kiefer, S., Luttenberger, M., Esparza, J.: On the convergence of Newton\u2019s method for monotone systems of polynomial equations. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 217\u2013226. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250822","key":"11_CR28","DOI":"10.1145\/1250790.1250822"},{"unstructured":"Luttenberger, M.: Algebraic Systems of Equations: Theory and Applications in Formal Languages and Game-Based Synthesis. Habilitation. Technische Universit\u00e4t M\u00fcnchen (2020)","key":"11_CR29"},{"unstructured":"Luttenberger, M., Schlund, M.: An extension of Parikh\u2019s theorem beyond idempotence (2013). arXiv:1112.2864 [cs.FL]","key":"11_CR30"},{"doi-asserted-by":"publisher","unstructured":"Luttenberger, M., Schlund, M.: Convergence of Newton\u2019s method over commutative semirings. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, 2\u20135 April 2013. Proceedings. LNCS, vol. 7810, pp. 407\u2013418. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-37064-9_36","key":"11_CR31","DOI":"10.1007\/978-3-642-37064-9_36"},{"unstructured":"Luttenberger, M., Schlund, M.: Regular expressions for provenance. In: Chapman, A., Lud\u00e4scher, B., Schreiber, A. (eds.) 6th Workshop on the Theory and Practice of Provenance, TaPP 2014, Cologne, Germany, 12\u201313 June 2014. USENIX Association (2014)","key":"11_CR32"},{"doi-asserted-by":"publisher","unstructured":"Pivoteau, C., Salvy, B., Soria, M.: Algorithms for combinatorial structures: well-founded systems and Newton iterations. J. Comb. Theory, Ser. A 119(8), 1711\u20131773 (2012). https:\/\/doi.org\/10.1016\/j.jcta.2012.05.007","key":"11_CR33","DOI":"10.1016\/j.jcta.2012.05.007"},{"doi-asserted-by":"publisher","unstructured":"Pivoteau, C., Salvy, B., Soria, M.: Algorithms for combinatorial structures: well-founded systems and Newton iterations. J. Comb. Theory Ser. A 119(8), 1711\u20131773 (2012). https:\/\/doi.org\/10.1016\/j.jcta.2012.05.007","key":"11_CR34","DOI":"10.1016\/j.jcta.2012.05.007"},{"doi-asserted-by":"publisher","unstructured":"Reps, T.W., Turetsky, E., Prabhu, P.: Newtonian program analysis via tensor product. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 663\u2013677 (2016). https:\/\/doi.org\/10.1145\/2837614.2837659","key":"11_CR35","DOI":"10.1145\/2837614.2837659"},{"doi-asserted-by":"publisher","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Cham (1978). ISBN: 978-0-387-90282-1. https:\/\/doi.org\/10.1007\/978-1-4612-6264-0","key":"11_CR36","DOI":"10.1007\/978-1-4612-6264-0"},{"unstructured":"Schlund, M.: Algebraic systems of fixpoint equations over semirings: theory and applications. Ph.D. thesis. Technical University Munich (2016)","key":"11_CR37"},{"doi-asserted-by":"crossref","unstructured":"Schlund, M., Luttenberger, M., Esparza, J.: Fast and accurate unlexicalized parsing via structural annotations. In: Bouma, G., Parmentier, Y. (eds.) Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2014, 26\u201330 April 2014, Gothenburg, Sweden, pp. 164\u2013168. The Association for Computer Linguistics (2014)","key":"11_CR38","DOI":"10.3115\/v1\/E14-4032"},{"doi-asserted-by":"publisher","unstructured":"Suwimonteerabuth, D., Schwoon, S., Esparza, J.: jMoped: a Java bytecode checker based on moped. In: Halbwachs, N., Zuck, L.D. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, 4\u20138 April 2005, Proceedings. LNCS, vol. 3440, pp. 541\u2013545. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/978-3-540-31980-1_35","key":"11_CR39","DOI":"10.1007\/978-3-540-31980-1_35"}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:03:13Z","timestamp":1730930593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}