{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T03:48:25Z","timestamp":1780717705584,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,1,11]],"date-time":"2006-01-11T00:00:00Z","timestamp":1136937600000},"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":[[2006,1,11]]},"DOI":"10.1145\/1111037.1111042","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T10:52:40Z","timestamp":1139223160000},"page":"42-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":335,"title":["Formal certification of a compiler back-end or"],"prefix":"10.1145","author":[{"given":"Xavier","family":"Leroy","sequence":"first","affiliation":[{"name":"INRIA Rocquencourt"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"41","volume-title":"Proceedings of AMAST'02","author":"Barthe G.","year":"2002","unstructured":"G. Barthe , P. Courtieu , G. Dufay , and S. M. de Sousa . Tool-Assisted Specification and Verification of the JavaCard Platform . In Proceedings of AMAST'02 , volume 2422 of LNCS , pages 41 -- 59 . Springer-Verlag , 2002 .]] G. Barthe, P. Courtieu, G. Dufay, and S. M. de Sousa. Tool-Assisted Specification and Verification of the JavaCard Platform. In Proceedings of AMAST'02, volume 2422 of LNCS, pages 41--59. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development -- Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran . Interactive Theorem Proving and Program Development -- Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science . Springer-Verlag , 2004 .]] Y. Bertot and P. Cast\u00e9ran. Interactive Theorem Proving and Program Development -- Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2004.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11617990_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11576280_20"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.02.042"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24725-8_27"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806984"},{"key":"e_1_3_2_1_8_1","volume-title":"Marseille","author":"Coupet-Grimal S.","year":"2005","unstructured":"S. Coupet-Grimal and W. Delobel . A Uniform and Certified Approach for Two Static Analyses. Research report 24-2005, Laboratoire d'Informatique Fondamentale , Marseille , France , April 2005 .]] S. Coupet-Grimal and W. Delobel. A Uniform and Certified Approach for Two Static Analyses. Research report 24-2005, Laboratoire d'Informatique Fondamentale, Marseille, France, April 2005.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"M","author":"Cousot P.","year":"1999","unstructured":"P. Cousot . The calculational design of a generic abstract interpreter. In M . Broy and R. Steinbr\u00fcggen, editors, Calculational System Design. NATO ASI Series F. IOS Press , Amsterdam, 1999 .]] P. Cousot. The calculational design of a generic abstract interpreter. In M. Broy and R. Steinbr\u00fcggen, editors, Calculational System Design. NATO ASI Series F. IOS Press, Amsterdam, 1999.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/966221.966235"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646839.759699"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229546"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-48092-7_10","volume-title":"Correct System Design, Recent Insight and Advances","author":"Goos G.","year":"1999","unstructured":"G. Goos and W. Zimmermann . Verification of compilers . In Correct System Design, Recent Insight and Advances , volume 1710 of LNCS , pages 201 -- 230 . Springer-Verlag , 1999 .]] G. Goos and W. Zimmermann. Verification of compilers. In Correct System Design, Recent Insight and Advances, volume 1710 of LNCS, pages 201--230. Springer-Verlag, 1999.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J.\n      Knoop D.\n      Kosch\u00fctzki and \n      B.\n      Steffen\n  . \n  Basic-block graphs: Living dinosaurs? In Proc. Compiler Construction '98 volume \n  1383\n   of \n  LNCS pages \n  65\n  --\n  79\n  . \n  Springer-Verlag 1998\n  .]]   J. Knoop D. Kosch\u00fctzki and B. Steffen. Basic-block graphs: Living dinosaurs? In Proc. Compiler Construction '98 volume 1383 of LNCS pages 65--79. Springer-Verlag 1998.]]","DOI":"10.1007\/BFb0026423"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2005.51"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040335"},{"key":"e_1_3_2_1_19_1","first-page":"200","volume-title":"Workshop TYPES 2002","volume":"2646","author":"Letouzey P.","year":"2003","unstructured":"P. Letouzey . A new extraction for Coq. In Types for Proofs and Programs , Workshop TYPES 2002 , volume 2646 of LNCS, pages 200 -- 219 . Springer-Verlag , 2003 .]] P. Letouzey. A new extraction for Coq. In Types for Proofs and Programs, Workshop TYPES 2002, volume 2646 of LNCS, pages 200--219. Springer-Verlag, 2003.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/83471.83477"},{"key":"e_1_3_2_1_21_1","volume-title":"Piton: a mechanically verified assembly-language","author":"Moore J. S.","year":"1996","unstructured":"J. S. Moore . Piton: a mechanically verified assembly-language . Kluwer , 1996 .]] J. S. Moore. Piton: a mechanically verified assembly-language. Kluwer, 1996.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349314"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360216"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645815.668891"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646482.691453"},{"key":"e_1_3_2_1_29_1","first-page":"169","volume-title":"Journ\u00e9es fran\u00e7aises des langages applicatifs (JFLA","author":"Rideau L.","year":"2005","unstructured":"L. Rideau and B. P. Serpette . Coq \u00e0 la conqu\u00eate des moulins . In Journ\u00e9es fran\u00e7aises des langages applicatifs (JFLA 2005 ), pages 169 -- 180 . INRIA , 2005.]] L. Rideau and B. P. Serpette. Coq \u00e0 la conqu\u00eate des moulins. In Journ\u00e9es fran\u00e7aises des langages applicatifs (JFLA 2005), pages 169--180. INRIA, 2005.]]"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. FLoC Workshop on Run-Time Result Verification","author":"Rinard M.","year":"1999","unstructured":"M. Rinard and D. Marinov . Credible compilation with pointers . In Proc. FLoC Workshop on Run-Time Result Verification , 1999 .]] M. Rinard and D. Marinov. Credible compilation with pointers. In Proc. FLoC Workshop on Run-Time Result Verification, 1999.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964002"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/559207"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/648238.751554"},{"key":"e_1_3_2_1_34_1","volume-title":"Universit\u00e9 Paul Sabatier","author":"Strecker M.","year":"2005","unstructured":"M. Strecker . Compiler verification for C0. Technical report , Universit\u00e9 Paul Sabatier , Toulouse , April 2005 .]] M. Strecker. Compiler verification for C0. Technical report, Universit\u00e9 Paul Sabatier, Toulouse, April 2005.]]"},{"key":"e_1_3_2_1_35_1","volume-title":"VOC: A translation validator for optimizing compilers. Electr. Notes Theor. Comput. Sci., 65(2)","author":"Zuck L. D.","year":"2002","unstructured":"L. D. Zuck , A. Pnueli , Y. Fang , and B. Goldberg . VOC: A translation validator for optimizing compilers. Electr. Notes Theor. Comput. Sci., 65(2) , 2002 .]] L. D. Zuck, A. Pnueli, Y. Fang, and B. Goldberg. VOC: A translation validator for optimizing compilers. Electr. Notes Theor. Comput. Sci., 65(2), 2002.]]"}],"event":{"name":"POPL06: The 33rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2006","location":"Charleston South Carolina USA","acronym":"POPL06","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111037.1111042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111037.1111042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:28Z","timestamp":1750268308000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111037.1111042"}},"subtitle":["programming a compiler with a proof assistant"],"short-title":[],"issued":{"date-parts":[[2006,1,11]]},"references-count":32,"alternative-id":["10.1145\/1111037.1111042","10.1145\/1111037"],"URL":"https:\/\/doi.org\/10.1145\/1111037.1111042","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1111320.1111042","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,1,11]]},"assertion":[{"value":"2006-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}