{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:58:10Z","timestamp":1743080290538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319406473"},{"type":"electronic","value":"9783319406480"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40648-0_12","type":"book-chapter","created":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T09:42:13Z","timestamp":1464946933000},"page":"150-165","source":"Crossref","is-referenced-by-count":7,"title":["Code Generation Using a Formal Model of Reference Counting"],"prefix":"10.1007","author":[{"given":"Gaspard","family":"F\u00e9rey","sequence":"first","affiliation":[]},{"given":"Natarajan","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,4]]},"reference":[{"issue":"9","key":"12_CR1","first-page":"807","volume":"18","author":"H-J Boehm","year":"1988","unstructured":"Boehm, H.-J., Weiser, M.: Garbage collection in an uncooperative environment. Softw.: Pract. Exp. 18(9), 807\u2013820 (1988)","journal-title":"Softw.: Pract. Exp."},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1017\/S0956796800001660","volume":"6","author":"J Chirimar","year":"1996","unstructured":"Chirimar, J., Gunter, C.A., Riecke, J.G.: Reference counting as a computational interpretation of linear logic. J. Funct. Program. 6(2), 195\u2013244 (1996)","journal-title":"J. Funct. Program."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-29613-5_6","volume-title":"Verified Software: Theories, Tools, and Experiments","author":"M Clochard","year":"2016","unstructured":"Clochard, M., Filli\u00e2tre, J.-C., Paskevich, A.: How to avoid proving the absence of integer overflows. In: Gurfinkel, A., et al. (eds.) VSTTE 2015. LNCS, vol. 9593, pp. 94\u2013109. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29613-5_6"},{"issue":"12","key":"12_CR4","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/367487.367501","volume":"3","author":"E George","year":"1960","unstructured":"George, E.: Collins: a method for overlapping and erasure of lists. Commun. ACM 3(12), 655\u2013657 (1960)","journal-title":"Commun. ACM"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","first-page":"35","volume-title":"ESOP 1990","author":"N Felleisen","year":"1990","unstructured":"Felleisen, N.: On the expressive power of programming languages. In: Jones, N. (ed.) ESOP 1990. LNCS, vol. 432, pp. 35\u201375. Springer, Heidelberg (1990)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations (with retrospective). In: McKinley, K.S. (ed.) Best of PLDI, pp. 502\u2013514. ACM (1993)","DOI":"10.1145\/155090.155113"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Hudak, P.: A semantic model of reference counting and its abstraction (detailed summary). In: Proceedings of 1986 ACM Conference on LISP and Functional Programming, pp. 351\u2013363. ACM, August 1986","DOI":"10.1145\/319838.319876"},{"issue":"7","key":"12_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009)","journal-title":"Commun. ACM"},{"issue":"9","key":"12_CR9","first-page":"575","volume":"6","author":"J Harold","year":"1963","unstructured":"Harold, J.: McBeth: On the reference counter method. Commun. ACM 6(9), 575 (1963)","journal-title":"Commun. ACM"},{"issue":"2","key":"12_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/32.345827","volume":"21","author":"S Owre","year":"1995","unstructured":"Owre, S., Rushby, J., Shankar, N., von Henke, F.: Formal verification for fault-tolerant architectures: prolegomena to the design of PVS. IEEE Trans. Softw. Eng. 21(2), 107\u2013125 (1995). PVS home page: http:\/\/pvs.csl.sri.com","journal-title":"IEEE Trans. Softw. Eng."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Logic Based Program Synthesis and Transformation","author":"N Shankar","year":"2002","unstructured":"Shankar, N.: Static analysis for safe destructive updates in a functional language. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 1\u201324. Springer, Heidelberg (2002)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Wilson, P.R.: Uniprocessor garbage collection techniques. In: Proceedings of International Workshop on Memory Management, IWMM 1992, St. Malo, France, pp. 1\u201342, 17\u201319 September 1992","DOI":"10.1007\/BFb0017182"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40648-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T03:10:22Z","timestamp":1567998622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40648-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319406473","9783319406480"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40648-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}