{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T04:16:22Z","timestamp":1782879382819,"version":"3.54.5"},"publisher-location":"Cham","reference-count":2,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030805142","type":"print"},{"value":"9783030805159","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80515-9_3","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:04:54Z","timestamp":1670529894000},"page":"23-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Standard Construction and Destruction Algorithms"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Singer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"key":"3_CR89","doi-asserted-by":"crossref","unstructured":"Cytron, R. K., et al. (1989). An efficient method of computing static single assignment form. In Proceedings of the Symposium on Principles of Programming Languages. POPL \u201989 (pp. 25\u201335).","DOI":"10.1145\/75277.75280"},{"issue":"4","key":"3_CR90","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R K Cytron","year":"1991","unstructured":"Cytron, R. K., et al. (1991). Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Language and Systems, 13(4), 451\u2013490.","journal-title":"ACM Transactions on Programming Language and Systems"}],"container-title":["SSA-based Compiler Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80515-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:05:09Z","timestamp":1670529909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80515-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"ISBN":["9783030805142","9783030805159"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80515-9_3","relation":{},"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"12 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}