{"id":"https://openalex.org/W4417298260","doi":"https://doi.org/10.1145/3779031.3779107","title":"Mechanized Dominator Tree Certification","display_name":"Mechanized Dominator Tree Certification","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W4417298260","doi":"https://doi.org/10.1145/3779031.3779107"},"language":"en","primary_location":{"id":"doi:10.1145/3779031.3779107","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3779031.3779107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-05413838/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120792856","display_name":"Jean-Christophe L\u00e9chenet","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"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I4210106545","display_name":"Centre Inria d'Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/01nzkaw91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106545"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Christophe L\u00e9chenet","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d'Azur, Inria, Sophia Antipolis, France","SED [Sophia] - Service Exp\u00e9rimentation et D\u00e9veloppement (Inria Sophia Antipolis -\r\nM\u00e9diterran\u00e9e 2004, route des Lucioles -\r\nBP 93 06902 Sophia Antipolis Cedex - France)","SPLITS - Languages de Programmation S\u00e9cures et Outils pour la S\u00e9curit\u00e9 (2004 routes des Lucioles\r\n06902 Sophia Antipolis - France)"],"raw_orcid":"https://orcid.org/0000-0003-0420-2745","affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d'Azur, Inria, Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I201841394"]},{"raw_affiliation_string":"SED [Sophia] - Service Exp\u00e9rimentation et D\u00e9veloppement (Inria Sophia Antipolis -\r\nM\u00e9diterran\u00e9e 2004, route des Lucioles -\r\nBP 93 06902 Sophia Antipolis Cedex - France)","institution_ids":["https://openalex.org/I4210106545"]},{"raw_affiliation_string":"SPLITS - Languages de Programmation S\u00e9cures et Outils pour la S\u00e9curit\u00e9 (2004 routes des Lucioles\r\n06902 Sophia Antipolis - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5120792856"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106545"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02686703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4659999907016754,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4659999907016754,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.16050000488758087,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.15970000624656677,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/validator","display_name":"Validator","score":0.5447999835014343},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.4099000096321106},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.4000000059604645},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38359999656677246},{"id":"https://openalex.org/keywords/certification","display_name":"Certification","score":0.375}],"concepts":[{"id":"https://openalex.org/C35292069","wikidata":"https://www.wikidata.org/wiki/Q1575458","display_name":"Validator","level":2,"score":0.5447999835014343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5289000272750854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4740000069141388},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.385699987411499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3822000026702881},{"id":"https://openalex.org/C46304622","wikidata":"https://www.wikidata.org/wiki/Q374814","display_name":"Certification","level":2,"score":0.375},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.36559998989105225},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.311599999666214}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3779031.3779107","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3779031.3779107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05413838v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05413838","pdf_url":"https://inria.hal.science/hal-05413838/document","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CPP 2026 - 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes, France. ⟨10.1145/3779031.3779107⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05413838v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05413838","pdf_url":"https://inria.hal.science/hal-05413838/document","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CPP 2026 - 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes, France. ⟨10.1145/3779031.3779107⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417298260.pdf","grobid_xml":"https://content.openalex.org/works/W4417298260.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,89],"modern":[1],"compilers,":[2],"many":[3],"optimizations":[4],"and":[5,44,62,92,118],"analyses,":[6],"in":[7,33,46,125],"particular":[8],"those":[9],"based":[10],"on":[11,16],"the":[12,39,67,82,126,130,136],"SSA":[13],"form,":[14],"rely":[15],"dominance":[17],"information,":[18],"so":[19,87],"computing":[20,85,145],"dominators":[21,32,86,124],"efficiently":[22],"is":[23,38,72,135],"an":[24],"important":[25],"problem.":[26],"The":[27],"classic":[28],"algorithm":[29,144],"to":[30,97,109],"compute":[31],"a":[34,95,102,121,142],"control":[35],"flow":[36],"graph":[37],"one":[40],"designed":[41],"by":[42],"Lengauer":[43],"Tarjan":[45,93],"1979.":[47],"Other":[48],"efficient":[49,60],"algorithms":[50,84],"have":[51],"been":[52],"proposed":[53],"since.":[54],"Previous":[55],"works":[56],"formally":[57,63],"verified":[58,132],"less":[59],"algorithms,":[61],"validated":[64],"parts":[65],"of":[66,79,81,123,141],"Lengauer-Tarjan":[68],"algorithm,":[69],"but":[70],"there":[71],"no":[73],"complete":[74,138],"formal":[75],"verification":[76],"or":[77],"validation":[78],"any":[80],"fast":[83,143],"far.":[88],"2016,":[90],"Georgiadis":[91],"described":[94],"method":[96],"tackle":[98],"these.":[99],"They":[100],"defined":[101],"certificate":[103],"with":[104],"which":[105],"it":[106],"becomes":[107],"easy":[108],"validate":[110],"dominators.":[111,146],"Following":[112],"their":[113],"method,":[114],"we":[115],"successfully":[116],"implemented":[117],"proved":[119],"correct":[120],"validator":[122],"Rocq":[127],"Prover,":[128],"inside":[129],"CompCertSSA":[131],"compiler.":[133],"This":[134],"first":[137],"mechanized":[139],"certification":[140]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-12-13T00:00:00"}