{"id":"https://openalex.org/W2890086097","doi":"https://doi.org/10.1145/3264738.3264739","title":"HELIX: a case study of a formal verification of high performance program generation","display_name":"HELIX: a case study of a formal verification of high performance program generation","publication_year":2018,"publication_date":"2018-09-17","ids":{"openalex":"https://openalex.org/W2890086097","doi":"https://doi.org/10.1145/3264738.3264739","mag":"2890086097"},"language":"en","primary_location":{"id":"doi:10.1145/3264738.3264739","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3264738.3264739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Workshop on Functional High-Performance Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5016005164","display_name":"Vadim Zaliva","orcid":"https://orcid.org/0000-0002-9145-3288"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vadim Zaliva","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062806943","display_name":"Franz Franchetti","orcid":"https://orcid.org/0000-0002-3529-8973"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Franz Franchetti","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"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.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"}},"topics":[{"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987999796867371,"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/T10142","display_name":"Formal Methods in Verification","score":0.9980000257492065,"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/correctness","display_name":"Correctness","score":0.8324170112609863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7983114719390869},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.7963123321533203},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.7647044658660889},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6595892906188965},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4908679127693176},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.47034576535224915},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42528122663497925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4244639575481415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10974308848381042},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.08821669220924377}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8324170112609863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7983114719390869},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.7963123321533203},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7647044658660889},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6595892906188965},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4908679127693176},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.47034576535224915},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42528122663497925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4244639575481415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10974308848381042},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.08821669220924377},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3264738.3264739","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3264738.3264739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN International Workshop on Functional High-Performance Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5,"display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1528855243","https://openalex.org/W1653213632","https://openalex.org/W2006731094","https://openalex.org/W2023035194","https://openalex.org/W2085050643","https://openalex.org/W2136952590","https://openalex.org/W2147146929","https://openalex.org/W2164688709","https://openalex.org/W2167029843","https://openalex.org/W2595625343","https://openalex.org/W2609223029","https://openalex.org/W2805888229","https://openalex.org/W4240054498","https://openalex.org/W4298447450"],"related_works":["https://openalex.org/W4299818930","https://openalex.org/W2467059325","https://openalex.org/W263998227","https://openalex.org/W2963664616","https://openalex.org/W2951087232","https://openalex.org/W2573990656","https://openalex.org/W2111870610","https://openalex.org/W4390724575","https://openalex.org/W1653213632","https://openalex.org/W4384026589"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"HELIX,":[5],"a":[6,20,55,96],"formally":[7,47],"verified":[8],"operator":[9],"language":[10],"and":[11,59,95,102],"rewriting":[12,76],"engine":[13],"for":[14,19,69,77],"generation":[15],"of":[16,22,36,39,74,85,108],"high-performance":[17],"implementation":[18],"variety":[21],"linear":[23],"algebra":[24],"algorithms.":[25],"Based":[26],"on":[27],"the":[28,34,86],"existing":[29],"SPIRAL":[30],"system,":[31],"HELIX":[32],"adds":[33],"rigor":[35],"formal":[37],"verification":[38],"its":[40],"correctness":[41,107],"using":[42],"Coq":[43],"proof":[44],"assistant.":[45],"It":[46],"defines":[48],"two":[49],"domain-specific":[50],"languages:":[51],"HCOL,":[52],"which":[53,61,89],"represents":[54],"computation":[56],"data":[57],"flow":[58],"\u03a3-HCOL,":[60],"extends":[62],"HCOL":[63],"with":[64],"iterative":[65],"computations.":[66],"A":[67],"framework":[68],"automatically":[70],"proving":[71],"semantic":[72],"preservation":[73],"expression":[75],"both":[78],"languages":[79],"is":[80,111],"presented.":[81,112],"The":[82],"structural":[83,106],"properties":[84],"dataflow":[87],"graph":[88],"allow":[90],"efficient":[91],"compilation":[92],"are":[93],"formalized,":[94],"monadic":[97],"approach":[98],"to":[99,103],"tracking":[100],"them":[101],"reasoning":[104],"about":[105],"\u03a3-HCOL":[109],"expressions":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}