default search action
Arthur Charguéraud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Guillaume Bertholon
, Arthur Charguéraud
Interactive Source-to-Source Optimizations Validated using Static Resource Analysis. SOAP@PLDI 2024: 26-34 - 2023
- [b1]Arthur Charguéraud:
A Modern Eye on Separation Logic for Sequential Programs. (Un nouveau regard sur la Logique de Séparation pour les programmes séquentiels). University of Strasbourg, France, 2023 - [j8]Arthur Charguéraud
Review on Functional Algorithms, Verified!: By Tobias Nipkow, Jasmin Blanchette, Manuel Eberl, Alejandro Gómez-Londoño, Peter Lammich, Christian Sternagel, Simon Wimmer, and Bohua Zhan Freely downloadable: https://functional-algorithms-verified.org. Formal Aspects Comput. 35(2): 13:1-13:2 (2023) - [j7]Alexandre Moine
A High-Level Separation Logic for Heap Space under Garbage Collection. Proc. ACM Program. Lang. 7(POPL): 718-747 (2023) - [j6]Arthur Charguéraud
Omnisemantics: Smooth Handling of Nondeterminism. ACM Trans. Program. Lang. Syst. 45(1): 5:1-5:43 (2023) - 2022
- [c26]Alexandre Moine
Specification and verification of a transient stack. CPP 2022: 82-99 - 2020
- [j5]Arthur Charguéraud
Separation logic for sequential programs (functional pearl). Proc. ACM Program. Lang. 4(ICFP): 116:1-116:34 (2020)
2010 – 2019
- 2019
- [j4]Arthur Charguéraud
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits. J. Autom. Reason. 62(3): 331-365 (2019) - [c25]Arthur Charguéraud, Jean-Christophe Filliâtre, Cláudio Lourenço
GOSPEL - Providing OCaml with a Formal Specification Language. FM 2019: 484-501 - [c24]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 - [c23]Umut A. Acar, Vitaly Aksenov
Provably and practically efficient granularity control. PPoPP 2019: 214-228 - 2018
- [j3]Robbert Krebbers, Jacques-Henri Jourdan
MoSeL: a general, extensible modal framework for interactive proofs in separation logic. Proc. ACM Program. Lang. 2(ICFP): 77:1-77:30 (2018) - [c22]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 - [c21]Yann Barsamian
Efficient Strict-Binning Particle-in-Cell Algorithm for Multi-core SIMD Processors. Euro-Par 2018: 749-763 - [c20]Umut A. Acar, Arthur Charguéraud, Adrien Guatto, Mike Rainey, Filip Sieczkowski
Heartbeat scheduling: provable efficiency for nested parallelism. PLDI 2018: 769-782 - [c19]Umut A. Acar, Vitaly Aksenov
Performance challenges in modular parallel programs. PPoPP 2018: 381-382 - [c18]Arthur Charguéraud, Alan Schmitt, Thomas Wood
JSExplain: A Double Debugger for JavaScript. WWW (Companion Volume) 2018: 691-699 - 2017
- [c17]Arthur Charguéraud, François Pottier:
Temporary Read-Only Permissions for Separation Logic. ESOP 2017: 260-286 - [c16]Yann Barsamian
A Space and Bandwidth Efficient Multicore Algorithm for the Particle-in-Cell Method. PPAM (1) 2017: 133-144 - [i1]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Parallel Work Inflation, Memory Effects, and their Empirical Analysis. CoRR abs/1709.03767 (2017) - 2016
- [j2]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Oracle-guided scheduling for controlling granularity in implicitly parallel languages. J. Funct. Program. 26: e23 (2016) - [c15]Arthur Charguéraud:
Higher-order representation predicates in separation logic. CPP 2016: 3-14 - [c14]Umut A. Acar, Arthur Charguéraud, Mike Rainey, Filip Sieczkowski
Dag-calculus: a calculus for parallel computation. ICFP 2016: 18-32 - 2015
- [c13]Arthur Charguéraud, François Pottier:
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation. ITP 2015: 137-153 - [c12]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
A work-efficient algorithm for parallel unordered depth-first search. SC 2015: 67:1-67:12 - 2014
- [c11]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Theory and Practice of Chunked Sequences. ESA 2014: 25-36 - [c10]Martin Bodin
A trusted mechanised JavaScript specification. POPL 2014: 87-100 - [c9]Arthur Charguéraud:
Improving Type Error Messages in OCaml. ML/OCaml 2014: 80-97 - 2013
- [c8]Arthur Charguéraud:
Pretty-Big-Step Semantics. ESOP 2013: 41-60 - [c7]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Scheduling parallel programs by work stealing with private deques. PPoPP 2013: 219-228 - 2012
- [j1]Arthur Charguéraud:
The Locally Nameless Representation. J. Autom. Reason. 49(3): 363-408 (2012) - 2011
- [c6]Arthur Charguéraud:
Characteristic formulae for the verification of imperative programs. ICFP 2011: 418-430 - [c5]Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Oracle scheduling: controlling granularity in implicitly parallel languages. OOPSLA 2011: 499-518 - 2010
- [c4]Arthur Charguéraud:
Program verification through characteristic formulae. ICFP 2010: 321-332 - [c3]Arthur Charguéraud:
The Optimal Fixed Point Combinator. ITP 2010: 195-210
2000 – 2009
- 2008
- [c2]Arthur Charguéraud, François Pottier:
Functional translation of a calculus of capabilities. ICFP 2008: 213-224 - [c1]Brian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich
Engineering formal metatheory. POPL 2008: 3-15
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-07-15 00:09 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: