{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:39Z","timestamp":1772164059610,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,27]],"date-time":"2013-10-27T00:00:00Z","timestamp":1382832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10,27]]},"DOI":"10.1145\/2517208.2517225","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T11:29:17Z","timestamp":1382527757000},"page":"155-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On the simplicity of synthesizing linked data structure operations"],"prefix":"10.1145","author":[{"given":"Darya","family":"Kurilova","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derek","family":"Rayside","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"263","volume":"146","author":"Adelson-Velskii G.","year":"1962","unstructured":"G. Adelson-Velskii and E. M. Landis . An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences , 146 : 263 -- 266 , 1962 . (Russian) English translation by Myron J. Ricci in Soviet Math. Doklady, 3(2):1259--1263, 1962. G. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146:263--266, 1962. (Russian) English translation by Myron J. Ricci in Soviet Math. Doklady, 3(2):1259--1263, 1962.","journal-title":"An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Press and McGraw-Hill , 2 nd edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press and McGraw-Hill, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1836089.1836091"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993506"},{"key":"e_1_3_2_1_6_1","volume-title":"Software Abstractions: Logic, Language, and Analysis","author":"Jackson D.","year":"2012","unstructured":"D. Jackson . Software Abstractions: Logic, Language, and Analysis . The MIT Press , revised edition, 2012 . D. Jackson. Software Abstractions: Logic, Language, and Analysis. The MIT Press, revised edition, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806632"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384646"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371401.2371407"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375599"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706337"},{"key":"e_1_3_2_1_13_1","volume-title":"MIT","author":"Yessenov K.","year":"2009","unstructured":"K. Yessenov . A light-weight specification language for bounded program verification. Master's thesis , MIT , 2009 . K. Yessenov. A light-weight specification language for bounded program verification. Master's thesis, MIT, 2009."}],"event":{"name":"GPCE'13: Generative Programming: Concepts and Experiences","location":"Indianapolis Indiana USA","acronym":"GPCE'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 12th international conference on Generative programming: concepts & experiences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517208.2517225","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517208.2517225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:40Z","timestamp":1750217320000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517208.2517225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,27]]},"references-count":12,"alternative-id":["10.1145\/2517208.2517225","10.1145\/2517208"],"URL":"https:\/\/doi.org\/10.1145\/2517208.2517225","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2637365.2517225","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,10,27]]},"assertion":[{"value":"2013-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}