{"id":"https://openalex.org/W4225163108","doi":"https://doi.org/10.1145/3527318","title":"Le temps des cerises: efficient temporal stack safety on capability machines using directed capabilities","display_name":"Le temps des cerises: efficient temporal stack safety on capability machines using directed capabilities","publication_year":2022,"publication_date":"2022-04-29","ids":{"openalex":"https://openalex.org/W4225163108","doi":"https://doi.org/10.1145/3527318"},"language":"en","primary_location":{"id":"doi:10.1145/3527318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527318","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://dl.acm.org/doi/pdf/10.1145/3527318","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041169923","display_name":"A\u00efna Linn Georges","orcid":"https://orcid.org/0000-0002-5951-4642"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"A\u00efna Linn Georges","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-5951-4642","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014999933","display_name":"Alix Trieu","orcid":"https://orcid.org/0000-0002-8239-8125"},"institutions":[{"id":"https://openalex.org/I4210108273","display_name":"Agence Nationale de S\u00e9curit\u00e9 du M\u00e9dicament et des Produits de Sant\u00e9","ror":"https://ror.org/01g80gk13","country_code":"FR","type":"government","lineage":["https://openalex.org/I4210108273"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alix Trieu","raw_affiliation_strings":["ANSSI, France"],"raw_orcid":"https://orcid.org/0000-0002-8239-8125","affiliations":[{"raw_affiliation_string":"ANSSI, France","institution_ids":["https://openalex.org/I4210108273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Aarhus University, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1320-0098","affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.081,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88638893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"6","issue":"OOPSLA1","first_page":"1","last_page":"30"},"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.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/T11424","display_name":"Security and Verification in Computing","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9902999997138977,"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.9839000105857849,"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/computer-science","display_name":"Computer science","score":0.8099605441093445},{"id":"https://openalex.org/keywords/call-stack","display_name":"Call stack","score":0.62986820936203},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5936044454574585},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5830039978027344},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.5395175218582153},{"id":"https://openalex.org/keywords/abstract-machine","display_name":"Abstract machine","score":0.5190987586975098},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.48294514417648315},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.46292567253112793},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36373913288116455}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8099605441093445},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.62986820936203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5936044454574585},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5830039978027344},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.5395175218582153},{"id":"https://openalex.org/C88977235","wikidata":"https://www.wikidata.org/wiki/Q787114","display_name":"Abstract machine","level":2,"score":0.5190987586975098},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.48294514417648315},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.46292567253112793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36373913288116455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3527318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527318","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:pure.atira.dk:publications/cd868947-6cc4-425c-af04-5d6f62ec2315","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/cd868947-6cc4-425c-af04-5d6f62ec2315","pdf_url":"https://pure.au.dk/ws/files/367247236/3527318.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Georges, A L, Trieu, A & Birkedal, L 2022, 'Le temps des cerises : Efficient temporal stack safety on capability machines using directed capabilities', Proceedings of the ACM on Programming Languages , vol. 6, no. OOPSLA1, 74. https://doi.org/10.1145/3527318","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3527318","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3527318","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3527318","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":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G6851704783","display_name":null,"funder_award_id":"25804","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4225163108.pdf","grobid_xml":"https://content.openalex.org/works/W4225163108.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W1520961854","https://openalex.org/W1904738922","https://openalex.org/W2028861803","https://openalex.org/W2079029390","https://openalex.org/W2085080904","https://openalex.org/W2100559921","https://openalex.org/W2117798902","https://openalex.org/W2127625071","https://openalex.org/W2135365827","https://openalex.org/W2147323041","https://openalex.org/W2148662736","https://openalex.org/W2153128836","https://openalex.org/W2158763360","https://openalex.org/W2162598060","https://openalex.org/W2361817505","https://openalex.org/W2509578035","https://openalex.org/W2517996894","https://openalex.org/W2562833768","https://openalex.org/W2567502494","https://openalex.org/W2596377803","https://openalex.org/W2610782608","https://openalex.org/W2761120147","https://openalex.org/W2795239434","https://openalex.org/W2796499075","https://openalex.org/W2798618564","https://openalex.org/W2885030506","https://openalex.org/W2900137615","https://openalex.org/W2901454403","https://openalex.org/W2912312736","https://openalex.org/W2943086984","https://openalex.org/W2962785744","https://openalex.org/W2963709481","https://openalex.org/W2971753713","https://openalex.org/W2973704179","https://openalex.org/W2974932038","https://openalex.org/W2995538315","https://openalex.org/W3113614934","https://openalex.org/W3151508267","https://openalex.org/W3188362363","https://openalex.org/W3211661085","https://openalex.org/W4225163108","https://openalex.org/W4235454363","https://openalex.org/W4249212548","https://openalex.org/W6912698325"],"related_works":["https://openalex.org/W2053968119","https://openalex.org/W3138340026","https://openalex.org/W1550998482","https://openalex.org/W4315630759","https://openalex.org/W3182891163","https://openalex.org/W2085253283","https://openalex.org/W2949377170","https://openalex.org/W1924086464","https://openalex.org/W3003830046","https://openalex.org/W4225163108"],"abstract_inverted_index":{"Capability":[0],"machines":[1,26],"are":[2,128],"a":[3,53,96,106,147,159,171,187],"type":[4],"of":[5,20,24,39,56,150,158,179],"CPUs":[6],"that":[7,17,142,165],"support":[8],"fine-grained":[9],"privilege":[10],"separation":[11],"using":[12],"capabilities":[13,58],",":[14],"machine":[15,81],"words":[16],"include":[18],"forms":[19,38],"authority.":[21],"Formal":[22],"models":[23,82],"capability":[25,80,189],"and":[27,47,59,105,175,183],"associated":[28],"calling":[29,70,168],"conventions":[30],"have":[31,193],"so":[32],"far":[33],"focused":[34],"on":[35,79,138],"establishing":[36],"two":[37],"stack":[40,122,143,182],"safety":[41,144],"properties,":[42],"namely":[43],"local":[44],"state":[45],"encapsulation":[46],"well-bracketed":[48],"control":[49],"flow.":[50],"We":[51],"introduce":[52],"novel":[54],"kind":[55],"directed":[57],"show":[60,155],"how":[61],"to":[62,65,76,100,110,118,186],"use":[63],"them":[64],"make":[66],"an":[67,162],"earlier":[68,77],"suggested":[69],"convention":[71,169],"more":[72],"efficient.":[73],"In":[74],"contrast":[75],"work":[78],"we":[83,94,153],"do":[84,136],"not":[85,137],"only":[86],"consider":[87],"integrity":[88],"properties":[89],"but":[90],"also":[91,154],"confidentiality":[92],"properties;":[93],"provide":[95],"unary":[97],"logical":[98,108,126],"relation":[99,109],"reason":[101,111,119],"about":[102,112,120,132],"the":[103,113,125,167,180],"former":[104],"binary":[107],"latter,":[114],"each":[115],"expressive":[116],"enough":[117],"temporal":[121],"safety.":[123],"While":[124],"relations":[127],"useful":[129],"for":[130,146],"reasoning":[131],"concrete":[133],"examples,":[134],"they":[135],"their":[139],"own":[140],"demonstrate":[141],"holds":[145],"large":[148],"class":[149],"programs.":[151],"Therefore,":[152],"full":[156],"abstraction":[157],"compiler":[160],"from":[161],"overlay":[163],"semantics":[164],"internalizes":[166],"as":[170],"single":[172],"call":[173,181],"step":[174],"explicitly":[176],"keeps":[177],"track":[178],"frame":[184],"lifetimes":[185],"base":[188],"machine.":[190],"All":[191],"results":[192],"been":[194],"mechanized":[195],"in":[196],"Coq.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}