{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:37:03Z","timestamp":1725557823901},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406648"},{"type":"electronic","value":"9783540451303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/10930755_9","type":"book-chapter","created":{"date-parts":[[2006,6,19]],"date-time":"2006-06-19T11:27:09Z","timestamp":1150716429000},"page":"136-154","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[]},{"given":"Nikita A.","family":"Sakhanenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(79)90035-5","volume":"9","author":"R. Aubin","year":"1979","unstructured":"Aubin, R.: Mechanizing structural induction II: Strategies. Theoretical Computer Science\u00a09, 347\u2013361 (1979)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The Automation of Proof by Mathematical Induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a01, pp. 845\u2013911 (2001)","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"key":"9_CR3","volume-title":"A Computational Logic","author":"R.S. Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.: A Computational Logic. Academic Press, London (1979)"},{"key":"9_CR4","unstructured":"Castaing, J.: How to facilitate the proof of theorems by using the inductionmatching and by generalization. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 1208\u20131213 (1985)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/10720327_17","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J. Giesl","year":"2000","unstructured":"Giesl, J.: Context-Moving Transformations for Function Verification. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 293\u2013312. Springer, Heidelberg (2000)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0956796899003408","volume":"9","author":"A. Ireland","year":"1999","unstructured":"Ireland, A., Bundy, A.: Automatic Verification of Functions with Accumulating Parameters. Journal of Functional Programming\u00a09(2), 225\u2013245 (1999)","journal-title":"Journal of Functional Programming"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0898-1221(94)00218-A","volume":"29","author":"D. Kapur","year":"1995","unstructured":"Kapur, D., Zhang, H.: An Overview of Rewrite Rule Laboratory (RRL). Journal of Computer and Mathematics with Applications\u00a029, 91\u2013114 (1995)","journal-title":"Journal of Computer and Mathematics with Applications"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/3-540-61511-3_112","volume-title":"Automated Deduction - Cade-13","author":"D. Kapur","year":"1996","unstructured":"Kapur, D., Subramaniam, M.: Lemma Discovery in Automating Induction. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 538\u2013552. Springer, Heidelberg (1996)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Klinger, W.D.: Proper Tail Recursion and Space Efficiency. In: Proc. ACM Programming Language Design and Implementation (1998)","DOI":"10.1145\/277650.277719"},{"key":"9_CR10","unstructured":"Vadera, S.: Generalization for Induction Mechanizing. Technical Report UMCS-93- 6-8 (1993)"},{"key":"9_CR11","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"C. Walther","year":"1994","unstructured":"Walther, C.: Mathematical Induction. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol.\u00a02. Oxford University Press, Oxford (1994)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0012831","volume-title":"9th International Conference on Automated Deduction","author":"H. Zhang","year":"1988","unstructured":"Zhang, H., Kapur, D., Krishnamoorthy, M.S.: A Mechanizable Induction Principle for Equational Specifications. In: Lusk, E.\u2018., Overbeek, R. (eds.) CADE 1988. LNCS, vol.\u00a0310, pp. 162\u2013181. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10930755_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:50:47Z","timestamp":1552600247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10930755_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406648","9783540451303"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/10930755_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}