{"id":"https://openalex.org/W4411267918","doi":"https://doi.org/10.1145/3729318","title":"Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers","display_name":"Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers","publication_year":2025,"publication_date":"2025-06-10","ids":{"openalex":"https://openalex.org/W4411267918","doi":"https://doi.org/10.1145/3729318"},"language":"en","primary_location":{"id":"doi:10.1145/3729318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729318","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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://doi.org/10.1145/3729318","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083566726","display_name":"Owen Conoly","orcid":"https://orcid.org/0009-0003-3129-1218"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Owen Conoly","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0009-0003-3129-1218","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082766906","display_name":"Andres Erbsen","orcid":"https://orcid.org/0000-0002-9854-7500"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andres Erbsen","raw_affiliation_strings":["Google, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-9854-7500","affiliations":[{"raw_affiliation_string":"Google, Cambridge, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078100439","display_name":"Adam Chlipala","orcid":"https://orcid.org/0000-0001-7085-9417"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Chlipala","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0001-7085-9417","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083566726"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.1733,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.88890603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"9","issue":"PLDI","first_page":"1692","last_page":"1715"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"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/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9991000294685364,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9980999827384949,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7594699263572693},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7251623272895813},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6758051514625549},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6540296673774719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.639655590057373},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6170120239257812},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4953674077987671},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3740142583847046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24920272827148438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2170373797416687}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7594699263572693},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7251623272895813},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6758051514625549},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6540296673774719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.639655590057373},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6170120239257812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4953674077987671},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3740142583847046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24920272827148438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2170373797416687},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3729318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729318","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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:dspace.mit.edu:1721.1/164688","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/164688","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"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":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"doi:10.1145/3729318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729318","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":[],"awards":[{"id":"https://openalex.org/G4546444706","display_name":null,"funder_award_id":"2130671","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1910149059","https://openalex.org/W2147380064","https://openalex.org/W2148662736","https://openalex.org/W2163005041","https://openalex.org/W2267469130","https://openalex.org/W2766545755","https://openalex.org/W2767162229","https://openalex.org/W2886207505","https://openalex.org/W2928036819","https://openalex.org/W2954033207","https://openalex.org/W2964540713","https://openalex.org/W2995664728","https://openalex.org/W3036557299","https://openalex.org/W3045655459","https://openalex.org/W3114864185","https://openalex.org/W3175981353","https://openalex.org/W3211894565","https://openalex.org/W4240497447","https://openalex.org/W4297927502","https://openalex.org/W4386316895","https://openalex.org/W4399851161","https://openalex.org/W4399851201","https://openalex.org/W4401717176","https://openalex.org/W4406222150","https://openalex.org/W6893201820"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W154364797","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"Formal":[0],"verification":[1],"of":[2,14,19,40,91,121,157,164,170],"software":[3],"and":[4,53,80,138,167,185,188],"compilers":[5],"has":[6,23],"been":[7],"used":[8],"to":[9,36,99,105,117,129,146,173],"rule":[10],"out":[11],"large":[12],"classes":[13],"security-critical":[15],"issues,":[16],"but":[17],"risk":[18],"unintentional":[20],"information":[21,69],"leakage":[22],"received":[24],"much":[25],"less":[26],"consideration.":[27],"It":[28],"is":[29,56],"a":[30,41,89,96,192],"key":[31,159],"requirement":[32],"for":[33,85,95,143],"formal":[34],"specifications":[35],"leave":[37],"some":[38],"details":[39],"system's":[42],"behavior":[43],"unspecified":[44],"so":[45],"that":[46,59,76,134],"future":[47],"implementation":[48],"changes":[49],"can":[50],"be":[51,64,100],"accommodated,":[52],"yet":[54],"it":[55,93],"nonetheless":[57],"expected":[58],"these":[60],"choices":[61,175],"would":[62],"not":[63],"made":[65],"based":[66],"on":[67],"confidential":[68],"the":[70,86,135,150,158,197],"system":[71],"handles.":[72],"This":[73],"paper":[74],"formalizes":[75],"notion":[77],"using":[78],"omnisemantics":[79,141],"plain":[81],"single-copy":[82],"assertions,":[83],"giving":[84],"first":[87],"time":[88],"specification":[90,137],"what":[92],"means":[94],"nondeterministic":[97,174],"program":[98],"constant-time":[101,147],"or":[102],"more":[103],"generally":[104],"avoid":[106],"leaking":[107],"(a":[108],"part":[109],"of)":[110],"its":[111],"inputs.":[112],"We":[113,153],"use":[114],"this":[115],"theory":[116],"prove":[118],"data-leak-free":[119],"execution":[120],"core":[122],"cryptographic":[123],"routines":[124],"compiled":[125],"from":[126],"Bedrock2":[127],"C":[128],"RISC-V":[130],"machine":[131],"code,":[132],"showing":[133],"smooth":[136],"proof":[139,199],"experience":[140],"provides":[142],"nondeterminism":[144],"extends":[145],"properties":[148],"in":[149,196],"same":[151],"setting.":[152],"also":[154],"study":[155],"variants":[156],"program-compiler":[160],"contract,":[161],"highlighting":[162],"pitfalls":[163],"tempting":[165],"simplifications":[166],"subtle":[168],"consequences":[169],"how":[171],"inputs":[172],"are":[176,180],"constrained.":[177],"Our":[178],"results":[179],"backed":[181],"by":[182],"modular":[183],"program-logic":[184],"compiler-correctness":[186],"theorems,":[187],"they":[189],"integrate":[190],"into":[191],"neat":[193],"end-to-end":[194],"theorem":[195],"Coq":[198],"assistant.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}