{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:51:15Z","timestamp":1743069075903,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367410"},{"type":"electronic","value":"9783642367427"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36742-7_17","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:41:56Z","timestamp":1361216516000},"page":"230-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted Pushdown Systems with Indexed Weight Domains"],"prefix":"10.1007","author":[{"given":"Yasuhiko","family":"Minamide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"17_CR2","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press (1974)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Kuich, W.: Finite automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch. 3, pp. 69\u2013104. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_3"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0890-5401(03)00139-1","volume":"186","author":"J. Esparza","year":"2003","unstructured":"Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Information and Computation\u00a0186(2), 355\u2013376 (2003)","journal-title":"Information and Computation"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY 1997. ENTCS, vol.\u00a09, pp. 27\u201339 (1997)","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Li, X., Ogawa, M.: Conditional weighted pushdown systems and applications. In: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pp. 141\u2013150 (2010)","DOI":"10.1145\/1706356.1706382"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-74591-4_14","volume-title":"Theorem Proving in Higher Order Logics","author":"Y. Minamide","year":"2007","unstructured":"Minamide, Y.: Verified Decision Procedures on Context-Free Grammars. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 173\u2013188. Springer, Heidelberg (2007)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-32759-9_26","volume-title":"FM 2012: Formal Methods","author":"Y. Minamide","year":"2012","unstructured":"Minamide, Y., Mori, S.: Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol.\u00a07436, pp. 293\u2013307. Springer, Heidelberg (2012)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/11924661_22","volume-title":"Programming Languages and Systems","author":"Y. Minamide","year":"2006","unstructured":"Minamide, Y., Tozawa, A.: XML Validation for Context-Free Grammars. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol.\u00a04279, pp. 357\u2013373. Springer, Heidelberg (2006)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.scico.2005.02.009","volume":"58","author":"T. Reps","year":"2005","unstructured":"Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Science of Computer Programming\u00a058, 206\u2013263 (2005)","journal-title":"Science of Computer Programming"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"1\/2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0019-9958(67)90529-3","volume":"11","author":"E. Shamir","year":"1967","unstructured":"Shamir, E.: A representation theorem for algebraic and context-free power series in non commuting variables. Information and Control\u00a011(1\/2), 239\u2013254 (1967)","journal-title":"Information and Control"},{"key":"17_CR13","unstructured":"Suwimonteerabuth, D.: Reachability in Pushdown Systems: Algorithms and Applications. PhD thesis, Technischen Universit\u00e4t M\u00fcnchen (2009)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-71389-0_25","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Tozawa","year":"2007","unstructured":"Tozawa, A., Minamide, Y.: Complexity Results on Balanced Context-Free Languages. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 346\u2013360. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36742-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:03:10Z","timestamp":1590969790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36742-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367410","9783642367427"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36742-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}