default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmaël Guéneau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Aïna Linn Georges
, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, Dominique Devriese, Lars Birkedal:
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. J. ACM 71(1): 3:1-3:59 (2024)- [j5]Amin Timany, Armaël Guéneau, Lars Birkedal:
The Logical Essence of Well-Bracketed Control Flow. Proc. ACM Program. Lang. 8(POPL): 575-603 (2024) - [j4]François Pottier, Armaël Guéneau, Jacques-Henri Jourdan, Glen Mével:
Thunks and Debits in Separation Logic with Time Credits. Proc. ACM Program. Lang. 8(POPL): 1482-1508 (2024) - 2023
- [j3]Armaël Guéneau, Johannes Hostert, Simon Spies, Michael Sammler, Lars Birkedal, Derek Dreyer:
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. Proc. ACM Program. Lang. 7(OOPSLA2): 716-744 (2023) - 2022
- [c4]Thomas Van Strydonck, Aïna Linn Georges, Armaël Guéneau, Alix Trieu, Amin Timany, Frank Piessens, Lars Birkedal, Dominique Devriese:
Proving full-system security properties under multiple attacker models on capability machines. CSF 2022: 80-95 - 2021
- [j2]Lars Birkedal, Thomas Dinsdale-Young, Armaël Guéneau, Guilhem Jaber, Kasper Svendsen, Nikos Tzevelekos:
Theorems for free from separation logic specifications. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [j1]Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, Sander Huyghebaert, Dominique Devriese, Lars Birkedal:
Efficient and provable local capability revocation using uninitialized capabilities. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [d1]Thomas Van Strydonck, Aïna Linn Georges, Armaël Guéneau, Alix Trieu, Amin Timany, Frank Piessens, Lars Birkedal, Dominique Devriese:
Proving full-system security properties under multiple attacker models on capability machines: Coq mechanization. Zenodo, 2021
2010 – 2019
- 2019
- [b1]Armaël Guéneau:
Mechanized Verification of the Correctness and Asymptotic Complexity of Programs. (Vérification mécanisée de la correction et complexité asymptotique de programmes). Inria, Paris, France, 2019 - [c3]Armaël Guéneau, Jacques-Henri Jourdan, Arthur Charguéraud, François Pottier:
Formal Proof and Analysis of an Incremental Cycle Detection Algorithm. ITP 2019: 18:1-18:20 - 2018
- [c2]Armaël Guéneau, Arthur Charguéraud, François Pottier:
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification. ESOP 2018: 533-560 - 2017
- [c1]Armaël Guéneau, Magnus O. Myreen, Ramana Kumar, Michael Norrish:
Verified Characteristic Formulae for CakeML. ESOP 2017: 584-610 - 2013
- [i1]Armaël Guéneau, François Pottier, Jonathan Protzenko:
The ins and outs of iteration in Mezzo. CoRR abs/1311.7256 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
