{"id":"https://openalex.org/W3116925569","doi":"https://doi.org/10.1145/3434321","title":"Verified code generation for the polyhedral model","display_name":"Verified code generation for the polyhedral model","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3116925569","doi":"https://doi.org/10.1145/3434321","mag":"3116925569"},"language":"en","primary_location":{"id":"doi:10.1145/3434321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434321","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3434321","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068829733","display_name":"Nathana\u00ebl Courant","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathana\u00ebl Courant","raw_affiliation_strings":["Inria, France"],"raw_orcid":"https://orcid.org/0000-0002-8736-3060","affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058330133","display_name":"Xavier Leroy","orcid":"https://orcid.org/0000-0002-8971-9171"},"institutions":[{"id":"https://openalex.org/I187986737","display_name":"Coll\u00e8ge de France","ror":"https://ror.org/04ex24z53","country_code":"FR","type":"education","lineage":["https://openalex.org/I187986737"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xavier Leroy","raw_affiliation_strings":["Coll\u00e8ge de France, France / PSL University, France"],"raw_orcid":"https://orcid.org/0000-0002-8971-9171","affiliations":[{"raw_affiliation_string":"Coll\u00e8ge de France, France / PSL University, France","institution_ids":["https://openalex.org/I187986737","https://openalex.org/I2746051580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8878,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84471669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"5","issue":"POPL","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7938442230224609},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7320910692214966},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7298686504364014},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6713882684707642},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6552614569664001},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6505258083343506},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6015809774398804},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5650444626808167},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5506057143211365},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5084642171859741},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.4709894359111786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41389745473861694},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4106316566467285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13019803166389465},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11762470006942749},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10868248343467712},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.07994997501373291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06948661804199219}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7938442230224609},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7320910692214966},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7298686504364014},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6713882684707642},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6552614569664001},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6505258083343506},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6015809774398804},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5650444626808167},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5506057143211365},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5084642171859741},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4709894359111786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41389745473861694},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4106316566467285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13019803166389465},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11762470006942749},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10868248343467712},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.07994997501373291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06948661804199219},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3434321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434321","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03000244v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03000244","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.40:1-40:24. &#x27E8;10.1145/3434321&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1145/3434321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3434321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3434321","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.49000000953674316,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3116925569.pdf","grobid_xml":"https://content.openalex.org/works/W3116925569.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W210983291","https://openalex.org/W1191262899","https://openalex.org/W1533186609","https://openalex.org/W1754158197","https://openalex.org/W1988233180","https://openalex.org/W1995270665","https://openalex.org/W2001358789","https://openalex.org/W2003937683","https://openalex.org/W2006731094","https://openalex.org/W2023035194","https://openalex.org/W2032391783","https://openalex.org/W2040856861","https://openalex.org/W2046877387","https://openalex.org/W2050948770","https://openalex.org/W2068326054","https://openalex.org/W2102976251","https://openalex.org/W2103412683","https://openalex.org/W2114067856","https://openalex.org/W2134087751","https://openalex.org/W2164890169","https://openalex.org/W2472147697","https://openalex.org/W2515012086","https://openalex.org/W2594877703","https://openalex.org/W2780077279","https://openalex.org/W2900153411","https://openalex.org/W2911450990","https://openalex.org/W2949967139","https://openalex.org/W2950655732","https://openalex.org/W2954224246","https://openalex.org/W2954725723","https://openalex.org/W2979365412","https://openalex.org/W3105758081","https://openalex.org/W4206368310","https://openalex.org/W4213255380","https://openalex.org/W4230473729","https://openalex.org/W4239562529"],"related_works":["https://openalex.org/W1819460135","https://openalex.org/W4295798319","https://openalex.org/W353523607","https://openalex.org/W3098927713","https://openalex.org/W1589866633","https://openalex.org/W2774311601","https://openalex.org/W650988184","https://openalex.org/W3106543884","https://openalex.org/W4310272897","https://openalex.org/W2162410319"],"abstract_inverted_index":{"The":[0,68],"polyhedral":[1,23,66],"model":[2],"is":[3,30],"a":[4,14,20,57,65],"high-level":[5],"intermediate":[6],"representation":[7],"for":[8],"loop":[9,17,24,39],"nests":[10,40],"that":[11,60],"supports":[12],"elegantly":[13],"great":[15],"many":[16],"optimizations.":[18],"In":[19],"compiler,":[21],"after":[22],"optimizations":[25],"have":[26],"been":[27],"performed,":[28],"it":[29],"necessary":[31],"and":[32,50,70],"difficult":[33],"to":[34],"regenerate":[35],"sequential":[36,62],"or":[37],"parallel":[38],"before":[41],"continuing":[42],"compilation.":[43],"This":[44],"paper":[45],"reports":[46],"on":[47],"the":[48,75],"formalization":[49,69],"proof":[51,77],"of":[52,55],"semantic":[53],"preservation":[54],"such":[56],"code":[58,63],"generator":[59],"produces":[61],"from":[64],"representation.":[67],"proofs":[71],"are":[72],"mechanized":[73],"using":[74],"Coq":[76],"assistant.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
