{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T23:10:18Z","timestamp":1784848218565,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662488980","type":"print"},{"value":"9783662488997","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48899-7_38","type":"book-chapter","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T22:59:28Z","timestamp":1448060368000},"page":"549-557","source":"Crossref","is-referenced-by-count":17,"title":["Constrained Term Rewriting tooL"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Kop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-02959-2_22","volume-title":"Automated Deduction \u2013 CADE-22","author":"S Falke","year":"2009","unstructured":"Falke, S., Kapur, D.: A term rewriting approach to the automated termination analysis of imperative programs. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 277\u2013293. Springer, Heidelberg (2009)"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-31365-3_20","volume-title":"Automated Reasoning","author":"S Falke","year":"2012","unstructured":"Falke, S., Kapur, D.: Rewriting Induction + Linear arithmetic = Decision procedure. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 241\u2013255. Springer, Heidelberg (2012)"},{"key":"38_CR4","unstructured":"Falke, S., Kapur, D., Sinz, C.: Termination analysis of C programs using compiler intermediate languages. In: Schmidt-Schau\u00df, M. (ed.) Proc. RTA 2011. LIPIcs, vol. 10, pp. 41\u201350. Dagstuhl (2011)"},{"issue":"2","key":"38_CR5","first-page":"100","volume":"1","author":"Y Furuichi","year":"2008","unstructured":"Furuichi, Y., Nishida, N., Sakai, M., Kusakari, K., Sakabe, T.: Approach to procedural-program verification based on implicit induction of constrained term rewriting systems. IPSJ Trans. Program. 1(2), 100\u2013121 (2008). In Japanese","journal-title":"IPSJ Trans. Program."},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-319-08587-6_13","volume-title":"Automated Reasoning","author":"J Giesl","year":"2014","unstructured":"Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Pl\u00fccker, M., Schneider-Kamp, P., Str\u00f6der, T., Swiderski, S., Thiemann, R.: Proving Termination of Programs Automatically with AProVE. In: Kapur, D., Weidenbach, C., Demri, S. (eds.) IJCAR 2014. LNCS, vol. 8562, pp. 184\u2013191. Springer, Heidelberg (2014)"},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1890028.1890030","volume":"33","author":"J Giesl","year":"2011","unstructured":"Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S., Thiemann, R.: Automated termination proofs for Haskell by term rewriting. ACM Trans. Program. Lang. Syst. (TOPLAS) 33(2), 71\u2013739 (2011)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reason. 37(3), 155\u2013203 (2006)","journal-title":"J. Autom. Reason."},{"key":"38_CR9","unstructured":"Kop, C.: Termination of LCTRSs. In: Waldmann, J. (ed.) Proceedings of WST, pp. 59\u201363 (2013)"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-40885-4_24","volume-title":"Frontiers of Combining Systems","author":"C Kop","year":"2013","unstructured":"Kop, C., Nishida, N.: Term Rewriting with Logical Constraints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS, vol. 8152, pp. 343\u2013358. Springer, Heidelberg (2013)"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-319-12736-1_18","volume-title":"Programming Languages and Systems","author":"C Kop","year":"2014","unstructured":"Kop, C., Nishida, N.: Automatic constrained rewriting induction towards verifying procedural programs. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 334\u2013353. Springer, Heidelberg (2014)"},{"key":"38_CR12","unstructured":"Kop, C., Nishida, N.: Towards verifying procedural programs using constrained rewriting induction. Technical report (2014). http:\/\/arxiv.org\/abs\/1409.0166"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of Java Bytecode by term rewriting. In: Lynch, C. (ed.) Proc. RTA 2010. LIPIcs, vol. 6, pp. 259\u2013276. Dagstuhl (2010)","DOI":"10.1007\/978-3-642-17172-7_2"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Reddy, U.S: Term rewriting induction. In: Stickel, M. (ed.) Proc. CADE 1990. LNCS, vol. 449, pp. 162\u2013177. Springer, Heidelberg (1990)","DOI":"10.1007\/3-540-52885-7_86"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48899-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T15:24:19Z","timestamp":1653578659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48899-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662488980","9783662488997"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48899-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}