{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:58:12Z","timestamp":1762459092682,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396106"},{"type":"electronic","value":"9783642396113"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39611-3_9","type":"book-chapter","created":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T22:33:07Z","timestamp":1372890787000},"page":"24-39","source":"Crossref","is-referenced-by-count":1,"title":["Proving Mutual Termination of Programs"],"prefix":"10.1007","author":[{"given":"Dima","family":"Elenbogen","sequence":"first","affiliation":[]},{"given":"Shmuel","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Ofer","family":"Strichman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Full version available from \n                    http:\/\/ie.technion.ac.il\/~ofers\/hvc-full.pdf"},{"key":"9_CR2","unstructured":"http:\/\/ie.technion.ac.il\/~ofers\/rvt.html"},{"key":"9_CR3","unstructured":"http:\/\/code.google.com\/p\/betik"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/11513988_48","volume-title":"Computer Aided Verification","author":"A.R. Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 491\u2013504. Springer, Heidelberg (2005)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E., Kroening, D.: Hardware verification using ANSI-C programs as a reference. In: Proceedings of ASP-DAC 2003, pp. 308\u2013311. IEEE Computer Society Press (January 2003)","DOI":"10.1145\/1119772.1119831"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11547662_8","volume-title":"Static Analysis","author":"B. Cook","year":"2005","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Abstraction refinement for termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 87\u2013101. Springer, Heidelberg (2005)"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/1941487.1941509","volume":"54","author":"B. Cook","year":"2011","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Proving program termination. Commun. ACM\u00a054(5), 88\u201398 (2011)","journal-title":"Commun. ACM"},{"issue":"1-4","key":"9_CR8","first-page":"1","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into sat. JSAT\u00a02(1-4), 1\u201326 (2006)","journal-title":"JSAT"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R. Floyd","year":"1967","unstructured":"Floyd, R.: Assigning meanings to programs. Proc. Symposia in Applied Mathematics\u00a019, 19\u201332 (1967)","journal-title":"Proc. Symposia in Applied Mathematics"},{"issue":"1","key":"9_CR10","first-page":"19","volume":"82","author":"L.E. Garner","year":"1981","unstructured":"Garner, L.E.: On the Collatz 3n + 1 algorithm. Proceedings of the American Mathematical Society\u00a082(1), 19\u201322 (1981)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00236-008-0075-2","volume":"45","author":"B. Godlin","year":"2008","unstructured":"Godlin, B., Strichman, O.: Inference rules for proving the equivalence of recursive procedures. Acta Informatica\u00a045(6), 403\u2013439 (2008)","journal-title":"Acta Informatica"},{"key":"9_CR12","unstructured":"Godlin, B., Strichman, O.: Regression verification. Technical Report IE\/IS-2011-02, Technion (2011), \n                    http:\/\/ie.technion.ac.il\/tech_reports\/1306207119_j.pdf"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Godlin, B., Strichman, O.: Regression verification. In: 46th Design Automation Conference, DAC (2009)","DOI":"10.1145\/1629911.1630034"},{"key":"9_CR14","unstructured":"Kawaguchi, M., Lahiri, S.K., Rebelo, H.: Conditional equivalence. Technical Report MSR-TR-2010-119, Microsoft Research (2010)"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39611-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:39:01Z","timestamp":1676324341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39611-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396106","9783642396113"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39611-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}