{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:56Z","timestamp":1761610256050,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3893,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80584-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"179-200","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Translation and Run-Time Validation of Optimized Code"],"prefix":"10.1016","volume":"70","author":[{"given":"Lenore","family":"Zuck","sequence":"first","affiliation":[]},{"given":"Amir","family":"Pnueli","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Hu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2002","series-title":"Optimizing Compilers for Modern Architectures","author":"Randy","key":"10.1016\/S1571-0661(04)80584-X_NEWBIB1"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","volume":"19","author":"Floyd","year":"1967","journal-title":"Proc. Symposia in Applied Mathematics"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB3","unstructured":"B. Goldberg, C. Huneycutt, E. Chapman, and K. Palem. Software bubbles: Using predication to compensate for aliasing in software pipelines. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), 2002"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Z. Manna, A. Anuchitanukul, N. Bj\u00f8rner, A. Browne, E. Chang, M. Col\u00f3n, L. De Alfaro, H. Devarajan, H. Sipma, and T. E. Uribe. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994","DOI":"10.21236\/ADA324036"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/263699.263712","article-title":"Proof-carrying code","author":"Necula","year":"1997","journal-title":"POPL'97"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"G. Necula. Translation validation of an optimizing compiler. In Proceedings of the ACM SIGPLAN Conference on Principles of Programming Languages Design and Implementation (PLDI) 2000, pages 83\u201395, 2000","DOI":"10.1145\/349299.349314"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"G. C. Necula and P. Lee. The design and implementation of a certifying compilers. In Proceedings of the ACM SIGPLAN Conference on Principles of Programming Languages Design and Implementation (PLDI) 1998, pages 333\u2013344, 1998","DOI":"10.1145\/277650.277752"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB8","first-page":"455","article-title":"Deciding equality formulas by small-domains instantiations","author":"Pnueli","year":"1999","journal-title":"CAV'99"},{"issue":"2","key":"10.1016\/S1571-0661(04)80584-X_NEWBIB9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s100090050027","article-title":"The code validation tool (CVT)- automatic verification of a compilation process","volume":"2","author":"Pnueli","year":"1998","journal-title":"Software Tools for Technology Transfer"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB10","first-page":"151","article-title":"Translation validation","author":"Pnueli","year":"1998","journal-title":"TACAS'98"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB11","unstructured":"A. Pnueli, L. Zuck, and P. Pandya. Translation validation of optimizing compilers by computational induction. Technical report, Courant Institute of Mathematical Sciences, New York University, 2000"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB12","unstructured":"M. Rinard and D. Marinov. Credible compilation with pointers. In Proceedings of the Run-Time Result Verification Workshop, Trento, July 2000"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB13","unstructured":"N. Shankar, S. Owre, and J. M. Rushby. The PVS proof checker: A reference manual (draft). Technical report, Comp. Sci., Laboratory, SRI International, Menlo Park, CA, 1993"},{"issue":"2","key":"10.1016\/S1571-0661(04)80584-X_NEWBIB14","article-title":"Voc: A translation validator for optimizing compilers","volume":"65","author":"Lenore","year":"2002","journal-title":"ENTCS"},{"key":"10.1016\/S1571-0661(04)80584-X_NEWBIB15","unstructured":"L. Zuck, A. Pnueli, and R. Leviathan. Validations of optimizing compliers. Technical report, Weizmann Institute of Science, 2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480584X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480584X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:01Z","timestamp":1761609961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480584X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S157106610480584X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80584-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Translation and Run-Time Validation of Optimized Code","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80584-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}