{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:47Z","timestamp":1725544307504},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540334385"},{"type":"electronic","value":"9783540334392"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11737414_14","type":"book-chapter","created":{"date-parts":[[2006,3,15]],"date-time":"2006-03-15T06:54:37Z","timestamp":1142405677000},"page":"192-207","source":"Crossref","is-referenced-by-count":18,"title":["Size-Change Termination and Bound Analysis"],"prefix":"10.1007","author":[{"given":"James","family":"Avery","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading (1975)"},{"key":"14_CR2","unstructured":"Avery, J., Schou, S.: Stopping C-Mix: PE-termination ensuring bindingtime division. Project at Roskilde Universitetscenter (2004)"},{"key":"14_CR3","unstructured":"Avery, J.: ESCT - The Extended Size-Change Termination Library (November 2005), http:\/\/esct.kvante.org"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Avery, J.: Size-change termination and bound analysis for an imperative language with integer data types. Report at Datalogisk Instutut, K\u00f8benhavns Universitet, DIKU (July 2005)","DOI":"10.1007\/11737414_14"},{"key":"14_CR5","unstructured":"Ben-Amram, A., Lee, C.S.: A quadratic-time program termination analysis. Under preparation at MPI f\u00fcr Informatik, Saarbr\u00fccken, Germany (2004)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/512760.512770","volume-title":"Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Conference Record of the Fifth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 84\u201397. ACM Press, New York (1978)"},{"key":"14_CR7","unstructured":"Bagnara, R., et al.: The parma polyhedra library, 2000-2005. University of Parma, http:\/\/www.cs.unipr.it\/ppl\/"},{"key":"14_CR8","unstructured":"Glenstrup, A.J., Jones, N.D.: Termination analysis and specialization-point insertion in off-line partial evaluation. ACM Transactions on Programming Languages and Systems. Department of Computer Science, University of Copenhagen (2003) (preprint)"},{"key":"14_CR9","unstructured":"Khoo, S.-C., Anderson, H.: Bounded size-change termination (draft). School of Computing. National University of Singapore (2005)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-45821-2_14","volume-title":"Generative Programming and Component Engineering","author":"C.S. Lee","year":"2002","unstructured":"Lee, C.S.: Program termination analysis in polynomial time. In: Batory, D., Consel, C., Taha, W. (eds.) GPCE 2002. LNCS, vol.\u00a02487, p. 218. Springer, Heidelberg (2002)"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/373243.360210","volume":"36","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., BenAmram, A.M.: The size-change principle for program termination. ACM SIGPLAN Notices\u00a036(3), 81\u201392 (2001)","journal-title":"ACM SIGPLAN Notices"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: Transition predicate abstraction and fair termination. In: Principles of Programming Languages (POPL) (2005)","DOI":"10.1145\/1040305.1040317"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45657-0_36","volume-title":"Computer Aided Verification","author":"H. Sipma","year":"2002","unstructured":"Sipma, H., Colon, M.: Practical methods for proving program termination. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 442\u2013454. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11737414_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T06:19:38Z","timestamp":1555481978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11737414_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540334385","9783540334392"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11737414_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}