{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:57:38Z","timestamp":1725533858167},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026577"},{"type":"electronic","value":"9783642026584"}],"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-02658-4_12","type":"book-chapter","created":{"date-parts":[[2009,6,22]],"date-time":"2009-06-22T07:00:16Z","timestamp":1245654016000},"page":"109-123","source":"Crossref","is-referenced-by-count":12,"title":["Size-Change Termination, Monotonicity Constraints and Ranking Functions"],"prefix":"10.1007","author":[{"given":"Amir M.","family":"Ben-Amram","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Lee, C.S.: Size-change analysis in polynomial time. ACM Transactions on Programming Languages and Systems\u00a029(1) (2007)","DOI":"10.1145\/1180475.1180480"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Amram, A.M., Lee, C.S.: Ranking functions for size-change termination II. Logical Methods in Computer Science (to appear, 2009)","DOI":"10.2168\/LMCS-5(2:8)2009"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/113413.113434","volume-title":"Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)","author":"A. Brodsky","year":"1991","unstructured":"Brodsky, A., Sagiv, Y.: Inference of inequality constraints in logic programs. In: Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 227\u2013240. ACM Press, New York (1991)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11562931_25","volume-title":"Logic Programming","author":"M. Codish","year":"2005","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Testing for termination with monotonicity constraints. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 326\u2013340. Springer, Heidelberg (2005)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Codish, M., Taboch, C.: A semantic basis for termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999); preliminary (conference) version in LNCS 1298. Springer, Heidelberg (1997)","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"12_CR6","first-page":"84","volume-title":"Conference Record of the Fifth annual ACM 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 Symposium on Principles of Programming Languages, pp. 84\u201396. ACM, New York (1978)"},{"issue":"1-2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s002000100065","volume":"12","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing\u00a012(1-2), 117\u2013156 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lee, C.S.: Ranking functions for size-change termination. ACM Transactions on Programming Languages and Systems (to appear, 2009)","DOI":"10.1145\/1498926.1498928"},{"key":"12_CR9","first-page":"81","volume-title":"Proceedings of the Twenty-Eigth ACM Symposium on Principles of Programming Languages","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: Proceedings of the Twenty-Eigth ACM Symposium on Principles of Programming Languages, vol.\u00a028, pp. 81\u201392. ACM Press, New York (2001)"},{"key":"12_CR10","first-page":"64","volume-title":"Proceedings of the Fourteenth International Conference on Logic Programming","author":"N. Lindenstrauss","year":"1997","unstructured":"Lindenstrauss, N., Sagiv, Y.: Automatic termination analysis of Prolog programs. In: Naish, L. (ed.) Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, pp. 64\u201377. MIT Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02658-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T21:19:34Z","timestamp":1558387174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02658-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026577","9783642026584"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02658-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}