{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:32Z","timestamp":1725565412425},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_9","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"119-133","source":"Crossref","is-referenced-by-count":11,"title":["A Verification Technique Using Term Rewriting Systems and Abstract Interpretation"],"prefix":"10.1007","author":[{"given":"Toshinori","family":"Takai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/BFb0032066","volume-title":"Automata, Languages and Programming","author":"H. Comon","year":"1990","unstructured":"Comon, H.: Equational Formulas in Order-Sorted Algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 674\u2013688. Springer, Heidelberg (1990)"},{"key":"9_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"9_CR4","first-page":"238","volume-title":"Proc. of 4th POPL","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. of 4th POPL, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"9_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/10721959_21","volume-title":"Automated Deduction - CADE-17","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol.\u00a01831, pp. 271\u2013290. Springer, Heidelberg (2000)"},{"issue":"1\u20132","key":"9_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","volume":"194","author":"P. Gyenizse","year":"1998","unstructured":"Gyenizse, P., V\u00e1gv\u00f6lgyi, S.: Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability. Theoretical Computer Science\u00a0194(1\u20132), 87\u2013122 (1998)","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-45085-6_2","volume-title":"Automated Deduction \u2013 CADE-19","author":"J. Meseguer","year":"2003","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Equational Abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 2\u201316. Springer, Heidelberg (2003)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Static Analysis","author":"D. Monniaux","year":"1999","unstructured":"Monniaux, D.: Abstracting Cryptographic Protocols with Tree Automata. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 149\u2013163. Springer, Heidelberg (1999)"},{"key":"9_CR9","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.: Abstract Interpretation. In: Principles of Program Analysis, ch. 4, Springer, Heidelberg (1999)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-53904-2_103","volume-title":"Rewriting Techniques and Applications","author":"K. Salomaa","year":"1991","unstructured":"Salomaa, K.: Decidability of Confluence and Termination of Monadic Term Rewriting Systems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 275\u2013286. Springer, Heidelberg (1991)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear Finite-Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. Scienticae Mathematicae Japonicae (to appear)","DOI":"10.1007\/10721975_17"},{"key":"9_CR13","unstructured":"Takai, T., Seki, H., Fujinaka, Y., Kaji, Y.: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. IEICE Transactions on Information and Systems E86-D(2), 285\u2013295 (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T10:00:58Z","timestamp":1553076058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}