{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T04:59:30Z","timestamp":1790398770275,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229435","type":"print"},{"value":"9783642229442","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22944-2_2","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T05:45:59Z","timestamp":1314251159000},"page":"19-35","source":"Crossref","is-referenced-by-count":5,"title":["Solving Fixed-Point Equations by Derivation Tree Analysis"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Luttenberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Syst.\u00a032(1), 1\u201333 (1999)","journal-title":"Theory Comput. Syst."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci.\u00a018, 115\u2013148 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-76336-9_20","volume-title":"Implementation and Application of Automata","author":"D. Caucal","year":"2007","unstructured":"Caucal, D., Czyzowicz, J., Fraczak, W., Rytter, W.: Efficient computation of throughput values of context-free languages. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 203\u2013213. Springer, Heidelberg (2007)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The Algebraic Theory of Context-Free Languages. In: Computer Programming and Formal Systems, pp. 118\u2013161. North Holland, Amsterdam (1963)"},{"key":"2_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M. Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Heidelberg (2009)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ganty, P.: Complexity of pattern-based verification for multithreaded programs. In: POPL, pp. 499\u2013510 (2011)","DOI":"10.1145\/1926385.1926443"},{"issue":"12","key":"2_CR7","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J. Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikhs theorem: A simple and direct automaton construction. Inf. Process. Lett.\u00a0111(12), 614\u2013619 (2011)","journal-title":"Inf. Process. Lett."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-73208-2_17","volume-title":"Developments in Language Theory","author":"J. Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: An extension of newton\u2019s method to \u03c9-continuous semirings. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 157\u2013168. Springer, Heidelberg (2007)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-70918-3_26","volume-title":"STACS 2007","author":"J. Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: On fixed point equations over commutative semirings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 296\u2013307. Springer, Heidelberg (2007)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-85780-8_24","volume-title":"Developments in Language Theory","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Derivation tree analysis for accelerated fixed-point computation. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 301\u2013313. Springer, Heidelberg (2008)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-70583-3_2","volume-title":"Automata, Languages and Programming","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newton\u2019s method for \u03c9-continuous semirings. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 14\u201326. Springer, Heidelberg (2008)"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1857914.1857917","volume":"57","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newtonian program analysis. J. ACM\u00a057(6), 33 (2010)","journal-title":"J. ACM"},{"key":"2_CR13","unstructured":"Ganty, P., Atig, M.: Approximating Petri net reachability along context-free traces. Technical report, arXiv:1105.1657v1 (2011)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: PODS, pp. 31\u201340 (2007)","DOI":"10.1145\/1265530.1265535"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-14295-6_52","volume-title":"Computer Aided Verification","author":"P. Ganty","year":"2010","unstructured":"Ganty, P., Majumdar, R., Monmege, B.: Bounded underapproximations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 600\u2013614. Springer, Heidelberg (2010)"},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S.C. Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. J. Symb. Log.\u00a03(4), 150\u2013155 (1938)","journal-title":"J. Symb. Log."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages, ch. 9","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata. In: Handbook of Formal Languages, ch. 9, vol.\u00a01, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"2_CR18","unstructured":"Luttenberger, M.: An extension of Parikh\u2019s theorem. Technical report, Technische Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik (forthcoming)"},{"key":"2_CR19","unstructured":"Luttenberger, M.: Solving Systems of Polynomial Equations: A Generalization of Newton\u2019s Method. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2010)"},{"key":"2_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"issue":"2","key":"2_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math.\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific J. Math."},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci.\u00a01(4), 317\u2013322 (1967)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22944-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:39:37Z","timestamp":1620041977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22944-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229435","9783642229442"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22944-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}