{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:36:59Z","timestamp":1780706219764,"version":"3.54.1"},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1145\/75277.75280","type":"proceedings-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T17:12:42Z","timestamp":1054573962000},"page":"25-35","source":"Crossref","is-referenced-by-count":282,"title":["An efficient method of computing static single assignment form"],"prefix":"10.1145","author":[{"given":"R.","family":"Cytron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Ferrante","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B. K.","family":"Rosen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. N.","family":"Wegman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. K.","family":"Zadeck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","event":{"name":"the 16th ACM SIGPLAN-SIGACT symposium","location":"Austin, Texas, United States","acronym":"POPL '89","number":"16","sponsor":["SIGPLAN, ACM Special Interest Group on Programming Languages","SIGACT, ACM Special Interest Group on Algorithms and Computation Theory"],"start":{"date-parts":[[1989,1,11]]},"end":{"date-parts":[[1989,1,13]]}},"container-title":["Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages  - POPL '89"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/75277.75280","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=75280&ftid=8858&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:15:13Z","timestamp":1750281313000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=75277.75280"}},"subtitle":[],"proceedings-subject":"Principles of programming languages","short-title":[],"issued":{"date-parts":[[1989]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/75277.75280","relation":{},"subject":[],"published":{"date-parts":[[1989]]}}}