{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:33Z","timestamp":1761596913373},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82598-8","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"377-394","source":"Crossref","is-referenced-by-count":7,"title":["Extracting a formally verified, fully executable compiler from a proof assistant"],"prefix":"10.1016","volume":"82","author":[{"given":"Stefan","family":"Berghofer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Strecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82598-8_BIB1","series-title":"Proc. TYPES Working Group Annual Meeting 2000, LNCS","article-title":"Executing higher order logic","author":"Berghofer","year":"2000"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB2","series-title":"Proc. of the Andrei Ershov Third International Conference Perspectives of System Informatics (PSI'99), Lecture Notes in Computer Science","article-title":"Formal verification of a compiler back-end generic checker program","author":"Dold","year":"1999"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB3","series-title":"Proceedings of RTRV '99: Workshop on Runtime Result Verification","article-title":"Construction of Verified Software Systems with Program-Checking: An Application To Compiler Back-Ends","author":"Gaul","year":"1999"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB4","article-title":"A guide to vlisp, a verified programming language implementation","author":"Guttman","year":"1992","journal-title":"Technical Report M92B091, The MITRE Corporation"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB5","series-title":"Proc. of the ACL2'2000 Workshop","article-title":"Proving Preservation of Partial Correctness with ACL2: A Mechanical Compiler Source Level Correctness Proof","author":"Goerigk","year":"2000"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB6","series-title":"Correct System Design, volume 1710 of Lecture Notes in Computer Science","first-page":"201","article-title":"Verification of compilers","author":"Goos","year":"1999"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB7","series-title":"Proc. COMPOS","first-page":"327","article-title":"An overview of compositional translations","author":"Janssen","year":"1997"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB8","unstructured":"Project Team LogiCal. The Coq Proof Assistant Reference Manual, Version 7.3.1. INRIA Rocquencourt - CNRS - ENS Lyon, May 2002."},{"key":"10.1016\/S1571-0661(05)82598-8_BIB9","unstructured":"Jon Meyer. Jasmin. http:\/\/mrl.nyu.edu\/~meyer\/jasmin\/."},{"key":"10.1016\/S1571-0661(05)82598-8_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/349299.349314","article-title":"Translation validation for an optimizing compiler","author":"Necula","year":"2000","journal-title":"Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI00)"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB11","series-title":"Foundations of Secure Computation. Proc. Int. Summer School Marktoberdorf 1999","first-page":"117","article-title":"\u03bcJava: Embedding a programming language in a theorem prover","author":"Nipkow","year":"2000"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB12","article-title":"Isabelle\/HOL. A Proof Assistant for Higher-Order Logic","volume":"2283","author":"Nipkow","year":"2002"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB13","unstructured":"David von Oheimb. Analyzing Java in Isabelle\/HOL: Formalization, Type Safety and Hoare Logic. PhD thesis, Technische Universit\u00e4t M\u00fcnchen, 2001. http:\/\/www4.in.tum.de\/~oheimb\/diss\/."},{"key":"10.1016\/S1571-0661(05)82598-8_BIB14","doi-asserted-by":"crossref","unstructured":"Norbert Schirmer. Analysing the Java package\/access concepts in Isabelle\/HOL. Concurrency and Computation: Practice and Experience, 2003. To appear.","DOI":"10.1002\/cpe.800"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB15","series-title":"FME'97: Formal Methods: Their Industrial Application and Strengthened Foundations, Lecture Notes in Computer Science","article-title":"Using PVS to prove a Z refinement: A case study","author":"Stringer-Calvert","year":"1997"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB16","unstructured":"SML-NJ. Standard ML of New Jersey homepage. http:\/\/cm.bell-labs.com\/cm\/cs\/what\/smlnj\/index.html."},{"key":"10.1016\/S1571-0661(05)82598-8_BIB17","series-title":"Java and the Java Virtual Machine - Definition, Verification, Validation","author":"St\u00e4rk","year":"2001"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB18","unstructured":"Susan Stepney. Incremental development of a high integrity compiler: experience from an industrial development. In Third IEEE High-Assurance Systems Engineering Symposium (HASE'98), November 1998. Online version available from http:\/\/public.logica.com\/~stepneys\/bib\/ss\/z\/incdev.htm."},{"key":"10.1016\/S1571-0661(05)82598-8_BIB19","series-title":"Proc. Conference on Automated Deduction (CADE), volume 2392 of Lecture Notes in Computer Science","first-page":"63","article-title":"Formal verification of a Java compiler in Isabelle","author":"Strecker","year":"2002"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB20","series-title":"Proc. Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), volume 2514 of Lecture Notes in Computer Science.","article-title":"Investigating type-certifying compilation with Isabelle","author":"Strecker","year":"2002"},{"key":"10.1016\/S1571-0661(05)82598-8_BIB21","article-title":"A mechanically verified code generator","author":"Young","year":"1989","journal-title":"Technical Report 37, Computational Logic Inc."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T11:07:42Z","timestamp":1586257662000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S1571066105825988"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82598-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}