default search action
Léo Stefanesco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Amin Timany
, Simon Oddershede Gregersen
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proc. ACM Program. Lang. 8(POPL): 241-272 (2024) - [c6]Léo Stefanesco, Azalea Raad, Viktor Vafeiadis:
Specifying and Verifying Persistent Libraries. ESOP (2) 2024: 185-211 - 2023
- [d1]Amin Timany
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement - Coq Artifact. Zenodo, 2023 - [i7]Léo Stefanesco, Azalea Raad, Viktor Vafeiadis:
Specifying and Verifying Persistent Libraries. CoRR abs/2306.01614 (2023) - 2022
- [j3]Arthur Oliveira Vale
Layered and object-based game semantics. Proc. ACM Program. Lang. 6(POPL): 1-32 (2022) - 2021
- [b1]Léo Stefanesco:
Asynchronous and Relational Soundness Theorems for Concurrent Separation Logic. (Théorèmes de correction asynchrone et relationnelle de la logique de séparation concurrente). Université de Paris, France, 2021 - [i6]Amin Timany
Trillium: Unifying Refinement and Higher-Order Distributed Separation Logic. CoRR abs/2109.07863 (2021) - 2020
- [j2]Paolo G. Giarrusso, Léo Stefanesco, Amin Timany
Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris. Proc. ACM Program. Lang. 4(ICFP): 114:1-114:29 (2020) - [c5]Paul-André Melliès, Léo Stefanesco:
Concurrent Separation Logic Meets Template Games. LICS 2020: 742-755 - [i5]Paul-André Melliès, Léo Stefanesco:
Concurrent Separation Logic Meets Template Games. CoRR abs/2005.04453 (2020) - [i4]Nobuko Yoshida, Simon Castellan, Léo Stefanesco:
Game Semantics: Easy as Pi. CoRR abs/2011.05248 (2020)
2010 – 2019
- 2018
- [j1]Amin Timany
A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST. Proc. ACM Program. Lang. 2(POPL): 64:1-64:28 (2018) - [c4]Paul-André Melliès, Léo Stefanesco:
An Asynchronous Soundness Theorem for Concurrent Separation Logic. LICS 2018: 699-708 - [c3]Paul-André Melliès, Léo Stefanesco:
A Game Semantics of Concurrent Separation Logic. MFPS 2018: 241-256 - [i3]Paul-André Melliès, Léo Stefanesco:
An Asynchronous soundness theorem for concurrent separation logic. CoRR abs/1807.08117 (2018) - 2017
- [i2]Paul-André Melliès, Léo Stefanesco:
A Game Semantics of Concurrent Separation Logic. CoRR abs/1710.02332 (2017) - 2015
- [c2]Delphine Demange, David Pichardie, Léo Stefanesco:
Verifying Fast and Sparse SSA-Based Optimizations in Coq. CC 2015: 233-252 - [c1]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu
Relational Reasoning via Probabilistic Coupling. LPAR 2015: 387-401 - [i1]Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Léo Stefanesco, Pierre-Yves Strub:
Relational reasoning via probabilistic coupling. CoRR abs/1509.03476 (2015)
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-11-25 22:47 CET 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: