{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T09:26:48Z","timestamp":1750670808670},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642150562"},{"type":"electronic","value":"9783642150579"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15057-9_10","type":"book-chapter","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T07:01:15Z","timestamp":1281510075000},"page":"142-156","source":"Crossref","is-referenced-by-count":10,"title":["Reusable Verification of a Copying\u00a0Collector"],"prefix":"10.1007","author":[{"given":"Magnus O.","family":"Myreen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11874683_12","volume-title":"Computer Science Logic","author":"N. Benton","year":"2006","unstructured":"Benton, N.: Abstracting allocation: The new new thing. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 182\u2013196. Springer, Heidelberg (2006)"},{"key":"10_CR2","unstructured":"Benton, N.: Machine obstructed proof (abstract). In: ACM SIGPLAN Workshop on Mechanizing Metatheory (2006)"},{"key":"10_CR3","volume-title":"Principles of programming languages (POPL)","author":"L. Birkedal","year":"2004","unstructured":"Birkedal, L., Torp-Smith, N., Reynolds, J.: Local reasoning about a copying garbage collector. In: Principles of programming languages (POPL). ACM, New York (2004)"},{"key":"10_CR4","volume-title":"Theorem Proving in Higher Order Logics (TPHOLs)","author":"S. B\u00f6hme","year":"2010","unstructured":"B\u00f6hme, S., Weber, T.: Fast LCF-style proof reconstruction for Z3. In: Theorem Proving in Higher Order Logics (TPHOLs), Springer, Heidelberg (to appear, 2010)"},{"issue":"11","key":"10_CR5","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1145\/359642.359655","volume":"21","author":"E.W. Dijkstra","year":"1978","unstructured":"Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S., Steffens, E.F.M.: On-the-fly garbage collection: an exercise in cooperation. Commun. ACM\u00a021(11), 966\u2013975 (1978)","journal-title":"Commun. ACM"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-61474-5_103","volume-title":"Computer Aided Verification","author":"G. Gonthier","year":"1996","unstructured":"Gonthier, G.: Verifying the safety of a practical concurrent garbage collector. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 462\u2013465. Springer, Heidelberg (1996)"},{"issue":"12","key":"10_CR7","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/359897.359903","volume":"20","author":"D. Gries","year":"1977","unstructured":"Gries, D.: An exercise in proving parallel programs correct. Commun. ACM\u00a020(12), 921\u2013930 (1977)","journal-title":"Commun. ACM"},{"issue":"1\/2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01128406","volume":"8","author":"J. Guttman","year":"1995","unstructured":"Guttman, J., Ramsdell, J., Wand, M.: VLISP: A verified implementation of Scheme. Lisp and Symbolic Computation\u00a08(1\/2), 5\u201332 (1995)","journal-title":"Lisp and Symbolic Computation"},{"key":"10_CR9","volume-title":"Principles of Programming Languages (POPL)","author":"C. Hawblitzel","year":"2009","unstructured":"Hawblitzel, C., Petrank, E.: Automated verification of practical garbage collectors. In: Principles of Programming Languages (POPL). ACM, New York (2009)"},{"key":"10_CR10","unstructured":"Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Design and Application of Strategies\/Tactics in Higher Order Logics (STRATA 2003), NASA\/CP-2003-212448 in NASA Technical Reports, pp. 56\u201368 (2003)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BFb0055139","volume-title":"Theorem Proving in Higher Order Logics","author":"P.B. Jackson","year":"1998","unstructured":"Jackson, P.B.: Verifying a garbage collection algorithm. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 225\u2013244. Springer, Heidelberg (1998)"},{"key":"10_CR12","first-page":"468","volume-title":"Programming Language Design and Implementation (PLDI)","author":"A. McCreight","year":"2007","unstructured":"McCreight, A., Shao, Z., Lin, C., Li, L.: A general framework for certifying garbage collectors and their mutators. In: Programming Language Design and Implementation (PLDI), pp. 468\u2013479. ACM, New York (2007)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-03359-9_25","volume-title":"Theorem Proving in Higher Order Logics (TPHOLs)","author":"M.O. Myreen","year":"2009","unstructured":"Myreen, M.O., Gordon, M.J.C.: Verified LISP implementations on ARM, x86 and PowerPC. In: Urban, C. (ed.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 359\u2013374. Springer, Heidelberg (2009)"},{"key":"10_CR14","volume-title":"Formal Methods in Computer Aided Design (FMCAD)","author":"M.O. Myreen","year":"2008","unstructured":"Myreen, M.O., Slind, K., Gordon, M.J.C.: Machine-code verification for multiple architectures \u2013 An application of decompilation into logic. In: Formal Methods in Computer Aided Design (FMCAD). IEEE, Los Alamitos (2008)"},{"key":"10_CR15","volume-title":"Logic in Computer Science (LICS)","author":"J. Reynolds","year":"2002","unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science (LICS). IEEE Computer Society, Los Alamitos (2002)"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01211305","volume":"6","author":"D.M. Russinoff","year":"1994","unstructured":"Russinoff, D.M.: A mechanically verified incremental garbage collector. Formal Asp. Comput.\u00a06(4), 359\u2013390 (1994)","journal-title":"Formal Asp. Comput."}],"container-title":["Lecture Notes in Computer Science","Verified Software: Theories, Tools, Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15057-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:46:05Z","timestamp":1619786765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15057-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150562","9783642150579"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15057-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}