{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:25:33Z","timestamp":1754486733017,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649878"},{"type":"electronic","value":"9783540498018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055139","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:09:13Z","timestamp":1153991353000},"page":"225-244","source":"Crossref","is-referenced-by-count":12,"title":["Verifying a garbage collection algorithm"],"prefix":"10.1007","author":[{"given":"Paul B.","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Rajeev Alur and Thomas A. Henzinger, editors. Computer Aided Verification: 8th International Conference, volume 1102 of Lecture Notes in Computer Science. Springer, July 1996.","DOI":"10.1007\/3-540-61474-5"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/579.587","volume":"6","author":"M. Ben-Ari","year":"1984","unstructured":"Mordechai Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3):333\u2013344, July 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR3","volume-title":"Distributed Systems Analysis with CCS","author":"G. Bruns","year":"1997","unstructured":"Glenn Bruns. Distributed Systems Analysis with CCS. Prentice Hall Europe, 1997."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Ching-Tsun Chou. Predicates, temporal logic, and simulations. In Jeffrey J. Joyce and Carl-Johan H. Seger, editors, Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop, HUG '93., volume 780 of Lecture Notes in Computer Science, pages 310\u2013323. Springer-Verlag, August 1993.","DOI":"10.1007\/3-540-57826-9_144"},{"issue":"11","key":"14_CR6","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1145\/359642.359655","volume":"21","author":"E. W. Dijkstra","year":"1978","unstructured":"Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):966\u2013975, November 1978.","journal-title":"Communications of the ACM"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dov M. Gabbay. Labelled deductive systems, volume 1 of Oxford Logic Guides. Oxford University Press (Imprint: Clarendon Press), 1996.","DOI":"10.1093\/oso\/9780198538332.003.0002"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Georges Gonthier. Verifying the safety of a practical concurrent garbage collector. In Alur and Henzinger [1].","DOI":"10.1007\/3-540-61474-5_103"},{"key":"14_CR9","unstructured":"Klaus Havelund. Mechanical verification of a garbage collector. Available from http:\/\/www.cs.auc.dk\/~havelund\/, May 1996."},{"key":"14_CR10","unstructured":"Klaus Havelund and Natarajan Shankar. A mechanized refinement proof for a garbage collector. Available from http:\/\/www.cs.auc.dk\/~havelund\/, December 1996."},{"key":"14_CR11","unstructured":"Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic memory Management. John Wiley & Sons, 1996."},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872\u2013923, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90041-Y","volume":"83","author":"Z. Manna","year":"1991","unstructured":"Zohar Manna and Amir Pnueli. Completing the temporal picture. Theoretical Computer Science, 83:97\u2013130, 1991.","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Zohar Manna and Amir Pnueli. Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1991.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"14_CR15","unstructured":"Stephan Merz. Yet another encoding of TLA in Isabelle. Available from http:\/\/www4.informatik.tu-muenchen.de\/~merz\/isabelle\/. The encoding described by this note accompanies the Isabelle98 release."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. Owicki","year":"1982","unstructured":"Susan Owicki and Leslie Lamport. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems, 4(3):455\u2013495, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748\u2013752. Springer-Verlag, 1992. See http:\/\/www.csl.sri.com\/pvs.html for up-to-date information on PVS.","DOI":"10.1007\/3-540-55602-8_217"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01211305","volume":"6","author":"D. M. Russinoff","year":"1994","unstructured":"David M. Russinoff. A mechanically verified garbage collector. Formal Aspects of Computing, 6:359\u2013390, 1994.","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:14:30Z","timestamp":1736478870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649878","9783540498018"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0055139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}