{"id":"https://openalex.org/W3152373953","doi":"https://doi.org/10.1109/cgo.2011.5764668","title":"Keynote II: Formally verifying a compiler: Why? How? How far?","display_name":"Keynote II: Formally verifying a compiler: Why? How? How far?","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W3152373953","doi":"https://doi.org/10.1109/cgo.2011.5764668","mag":"3152373953"},"language":"en","primary_location":{"id":"doi:10.1109/cgo.2011.5764668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2011.5764668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO 2011)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058330133","display_name":"Xavier Leroy","orcid":"https://orcid.org/0000-0002-8971-9171"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Xavier Leroy","raw_affiliation_strings":["INRIA Paris-Rocquencourt","GALLIUM - Programming languages, types, compilation and proofs (France)"],"affiliations":[{"raw_affiliation_string":"INRIA Paris-Rocquencourt","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"GALLIUM - Programming languages, types, compilation and proofs (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058330133"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.39173682,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77050461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"xxxi","last_page":"xxxi"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.9004371166229248},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8604519367218018},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.8152254223823547},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.807883620262146},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.6845923662185669},{"id":"https://openalex.org/keywords/compiler-correctness","display_name":"Compiler correctness","score":0.6149887442588806},{"id":"https://openalex.org/keywords/compiler-construction","display_name":"Compiler construction","score":0.6003155708312988},{"id":"https://openalex.org/keywords/dead-code-elimination","display_name":"Dead code elimination","score":0.5976280570030212},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.5436022877693176},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.5350329279899597},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4690188765525818},{"id":"https://openalex.org/keywords/object-code","display_name":"Object code","score":0.2733280658721924},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.23591646552085876},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.132224440574646}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.9004371166229248},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8604519367218018},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.8152254223823547},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.807883620262146},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.6845923662185669},{"id":"https://openalex.org/C68366613","wikidata":"https://www.wikidata.org/wiki/Q5156378","display_name":"Compiler correctness","level":3,"score":0.6149887442588806},{"id":"https://openalex.org/C9957790","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler construction","level":3,"score":0.6003155708312988},{"id":"https://openalex.org/C2144512","wikidata":"https://www.wikidata.org/wiki/Q1143090","display_name":"Dead code elimination","level":5,"score":0.5976280570030212},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.5436022877693176},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.5350329279899597},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4690188765525818},{"id":"https://openalex.org/C154526789","wikidata":"https://www.wikidata.org/wiki/Q157965","display_name":"Object code","level":4,"score":0.2733280658721924},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.23591646552085876},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.132224440574646},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cgo.2011.5764668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo.2011.5764668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Code Generation and Optimization (CGO 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1988233180","https://openalex.org/W2023035194","https://openalex.org/W2148662736","https://openalex.org/W4245487037"],"related_works":["https://openalex.org/W2083681681","https://openalex.org/W2053033210","https://openalex.org/W4220800565","https://openalex.org/W2912784218","https://openalex.org/W3092209149","https://openalex.org/W1597127505","https://openalex.org/W3140187916","https://openalex.org/W2911899620","https://openalex.org/W4250310298","https://openalex.org/W4233252967"],"abstract_inverted_index":{"Given":[0],"the":[1,12,52,62,72,81,84],"complexity":[2],"and":[3,8,11,27],"sophistication":[4],"of":[5,14,44,83],"code":[6,32,75],"generation":[7],"optimization":[9],"algorithms,":[10],"difficulty":[13],"systematically":[15],"testing":[16],"a":[17,37,45,48],"compiler,":[18],"it":[19],"is":[20,33,47],"unsurprising":[21],"that":[22,71],"bugs":[23],"occur":[24],"in":[25],"compilers":[26],"cause":[28],"miscompilation:":[29],"incorrect":[30],"executable":[31,74],"silently":[34],"generated":[35,73],"from":[36],"correct":[38],"source":[39,85],"program.":[40,86],"The":[41],"formal":[42,57],"verification":[43,66],"compiler":[46,63,65],"radical":[49],"solution":[50],"to":[51,61],"miscompilation":[53],"issue.":[54],"By":[55],"applying":[56],"methods":[58],"(program":[59],"proof)":[60],"itself,":[64],"proves,":[67],"with":[68],"mathematical":[69],"certainty,":[70],"behaves":[76],"exactly":[77],"as":[78],"prescribed":[79],"by":[80],"semantics":[82]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}