{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:52:15Z","timestamp":1762458735374,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642023477"},{"type":"electronic","value":"9783642023484"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02348-4_20","type":"book-chapter","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T07:27:21Z","timestamp":1245310041000},"page":"285-294","source":"Crossref","is-referenced-by-count":6,"title":["VMTL\u2013A Modular Termination Laboratory"],"prefix":"10.1007","author":[{"given":"Felix","family":"Schernhammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Gramlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/978-3-540-89439-1_44","volume-title":"LPAR 2008","author":"B. Alarc\u00f3n","year":"2008","unstructured":"Alarc\u00f3n, B., Emmes, F., Fuhs, C., Giesl, J., Guti\u00e9rrez, R., Lucas, S., Schneider-Kamp, P., Thiemann, R.: Improving context-sensitive dependency pairs. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol.\u00a05330, pp. 636\u2013651. Springer, Heidelberg (2008)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11944836_28","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"B. Alarc\u00f3n","year":"2006","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S.: Context-sensitive dependency pairs. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 297\u2013308. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"20_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236(1\u20132), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"20_CR4","doi-asserted-by":"publisher","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, New York (1998)"},{"key":"20_CR5","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term rewriting systems","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term rewriting systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10990-008-9028-2","volume":"21","author":"F. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J., March\u00e9, C., Urbain, X.: Proving operational termination of membership equational programs. Higher-Order and Symbolic Computation\u00a021, 59\u201388 (2008)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"3","key":"20_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. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Recent Trends in Algebraic Development Techniques (WADT 2008) \u2013 Selected Papers","author":"K. Gmeiner","year":"2009","unstructured":"Gmeiner, K., Gramlich, B.: Transformations of conditional rewrite systems revisited. In: Corradini, A., Montanari, U. (eds.) Recent Trends in Algebraic Development Techniques (WADT 2008) \u2013 Selected Papers. LNCS. Springer, Heidelberg (to appear, 2009)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-70590-1_9","volume-title":"Rewriting Techniques and Applications","author":"R. Guti\u00e9rrez","year":"2008","unstructured":"Guti\u00e9rrez, R., Lucas, S., Urbain, X.: Usable rules for context-sensitive rewrite systems. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 126\u2013141. Springer, Heidelberg (2008)"},{"key":"20_CR11","unstructured":"Koprowski, A.: Termination of rewriting and its certification. PhD thesis, Eindhoven University of Technology (2008)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1) (January 1998)","DOI":"10.1142\/9789814528849"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S. Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf.\u00a0Process.\u00a0Lett.\u00a095(4), 446\u2013453 (2005)","journal-title":"Inf.\u00a0Process.\u00a0Lett."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-61735-3_7","volume-title":"Algebraic and Logic Programming","author":"M. Marchiori","year":"1996","unstructured":"Marchiori, M.: Unravelings and ultra-properties. In: Hanus, M., Rodr\u00edguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol.\u00a01139, pp. 107\u2013121. Springer, Heidelberg (1996)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-32033-3_20","volume-title":"Term Rewriting and Applications","author":"N. Nishida","year":"2005","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Partial inversion of constructor term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 264\u2013278. Springer, Heidelberg (2005)"},{"key":"20_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced topics in term rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced topics in term rewriting. Springer, London (2002)"},{"key":"20_CR17","unstructured":"Schernhammer, F., Gramlich, B.: Characterizing and proving operational termination of deterministic conditional term rewriting systems. Technical Report E1852-2009-01, TU Wien (March 2009), http:\/\/www.logic.at\/vmtl\/"},{"key":"20_CR18","unstructured":"The termination competition, http:\/\/termination-portal.org\/wiki\/Termination_Competition"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00200-005-0179-7","volume":"16","author":"R. Thiemann","year":"2005","unstructured":"Thiemann, R., Giesl, J.: The size-change principle and dependency pairs for termination of term rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a016(4), 229\u2013270 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"}],"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-642-02348-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T06:13:07Z","timestamp":1739167987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02348-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023477","9783642023484"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02348-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}