{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:11Z","timestamp":1740099251972,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030047702"},{"type":"electronic","value":"9783030047719"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04771-9_34","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T17:02:53Z","timestamp":1544029373000},"page":"479-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifying a Copying Garbage Collector in GP 2"],"prefix":"10.1007","author":[{"given":"Gia S.","family":"Wulandari","sequence":"first","affiliation":[]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-40530-8_7","volume-title":"Graph Transformation","author":"C Bak","year":"2016","unstructured":"Bak, C., Plump, D.: Compiling graph programs to C. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 102\u2013117. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40530-8_7"},{"key":"34_CR2","doi-asserted-by":"publisher","unstructured":"Birkedal, L., Torp-Smith, N., Reynolds, J.C.: Local reasoning about a copying garbage collector. In Proceedings Symposium on Principles of Programming Languages (POPL 2004), pp. 220\u2013231. ACM (2004). https:\/\/doi.org\/10.1145\/964001.964020","DOI":"10.1145\/964001.964020"},{"issue":"11","key":"34_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1145\/362790.362798","volume":"13","author":"CJ Cheney","year":"1970","unstructured":"Cheney, C.J.: A nonrecursive list compacting algorithm. Commun. ACM 13(11), 677\u2013678 (1970). https:\/\/doi.org\/10.1145\/362790.362798","journal-title":"Commun. ACM"},{"key":"34_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press, Cambridge (2012). https:\/\/doi.org\/10.1017\/CBO9780511977619"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1145\/2480359.2429131","volume":"48","author":"Aquinas Hobor","year":"2013","unstructured":"Hobor, A., Villard, J.: The ramifications of sharing in data structures. In Proceedings Symposium on Principles of Programming Languages (POPL 2013), pp. 523\u2013536. ACM (2013). https:\/\/doi.org\/10.1145\/2480359.2429131","journal-title":"ACM SIGPLAN Notices"},{"key":"34_CR6","doi-asserted-by":"publisher","unstructured":"Klarlund, N., Schwartzbach, M.: Verification of pointers. DAIMI Report Series 23(470). Aarhus University (1994). https:\/\/doi.org\/10.7146\/dpb.v23i470.6943","DOI":"10.7146\/dpb.v23i470.6943"},{"key":"34_CR7","unstructured":"Mccreight, A.E.: The Mechanized Verification of Garbage Collector Implementations. Ph.D thesis, Yale University (2008)"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-15057-9_10","volume-title":"Verified Software: Theories, Tools, Experiments","author":"MO Myreen","year":"2010","unstructured":"Myreen, M.O.: Reusable verification of a copying collector. In: Leavens, G.T., O\u2019Hearn, P., Rajamani, S.K. (eds.) VSTTE 2010. LNCS, vol. 6217, pp. 142\u2013156. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15057-9_10"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebraic Program. 60\u201361, 17\u2013139 (2004). https:\/\/doi.org\/10.1016\/j.jlap.2004.05.001","journal-title":"J. Log. Algebraic Program."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4204\/EPTCS.225.6","volume":"225","author":"Detlef Plump","year":"2016","unstructured":"Plump, D.: Reasoning about graph programs. In: Proceedings Computing with Terms and Graphs (TERMGRAPH 2016), Electronic Proceedings in Theoretical Computer Science, vol. 225, pp. 35\u201344 (2016). https:\/\/doi.org\/10.4204\/EPTCS.225.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jlamp.2016.12.001","volume":"88","author":"D Plump","year":"2017","unstructured":"Plump, D.: From imperative to rule-based graph programs. J. Log. Algebraic Methods Program. 88, 154\u2013173 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.12.001","journal-title":"J. Log. Algebraic Methods Program."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M.: Verification of Graph Programs. Ph.D thesis, University of York (2013)","DOI":"10.1007\/978-3-642-33654-6_30"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.3233\/FI-2012-708","volume":"118","author":"CM Poskitt","year":"2012","unstructured":"Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundamenta Informaticae 118(1), 135\u2013175 (2012). https:\/\/doi.org\/10.3233\/FI-2012-708","journal-title":"Fundamenta Informaticae"},{"key":"34_CR14","doi-asserted-by":"publisher","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. In: Proceedings International Workshop on Graph Computation Models (GCM 2012) 2012. Revised version, Electronic Communications of the EASST, vol. 61 (2013). https:\/\/doi.org\/10.14279\/tuj.eceasst.61.827","DOI":"10.14279\/tuj.eceasst.61.827"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-09108-2_3","volume-title":"Graph Transformation","author":"CM Poskitt","year":"2014","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 33\u201348. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_3"},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/964001.964020","volume":"30","author":"N Torp-Smith","year":"2008","unstructured":"Torp-Smith, N., Birkedal, L., Reynolds, J.C.: Local reasoning about a copying garbage collector. ACM Trans. Program. Lang. Syst. 30(4), 24:1\u201324:58 (2008). https:\/\/doi.org\/10.1145\/964001.964020","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Software Technologies: Applications and Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04771-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T15:52:57Z","timestamp":1573055577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04771-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030047702","9783030047719"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04771-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"STAF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Federation of International Conferences on Software Technologies: Applications and Foundations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"staf2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.staf2018.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}