Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuele D'Osualdo
Person information
- affiliation: Techical University of Kaiserslautern, Department of Computer Science
- affiliation: Oxford University, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Emanuele D'Osualdo:
Verification of message passing concurrent systems. University of Oxford, UK, 2015
Journal Articles
- 2023
- [j5]Emanuele D'Osualdo
, Azalea Raad, Viktor Vafeiadis:
The Path to Durable Linearizability. Proc. ACM Program. Lang. 7(POPL): 748-774 (2023) - [j4]Michael Sammler, Simon Spies, Youngju Song, Emanuele D'Osualdo, Robbert Krebbers, Deepak Garg, Derek Dreyer:
DimSum: A Decentralized Approach to Multi-language Semantics and Verification. Proc. ACM Program. Lang. 7(POPL): 775-805 (2023) - 2022
- [j3]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving hypersafety compositionally. Proc. ACM Program. Lang. 6(OOPSLA2): 289-314 (2022) - [j2]Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
A bunch of sessions: a propositions-as-sessions interpretation of bunched implications in channel-based concurrency. Proc. ACM Program. Lang. 6(OOPSLA2): 841-869 (2022) - 2021
- [j1]Emanuele D'Osualdo, Julian Sutherland, Azadeh Farzan, Philippa Gardner:
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. ACM Trans. Program. Lang. Syst. 43(4): 16:1-16:134 (2021)
Conference and Workshop Papers
- 2020
- [c6]Emanuele D'Osualdo, Felix Stutz:
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CONCUR 2020: 31:1-31:23 - 2017
- [c5]Emanuele D'Osualdo, Luke Ong, Alwen Tiu:
Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-Bounded Processes. CSF 2017: 464-480 - 2016
- [c4]Emanuele D'Osualdo, C.-H. Luke Ong:
On Hierarchical Communication Topologies in the \pi -calculus. ESOP 2016: 149-175 - [c3]Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche:
First-order logic with reachability for infinite-state systems. LICS 2016: 457-466 - 2013
- [c2]Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong:
Automatic Verification of Erlang-Style Concurrency. SAS 2013: 454-476 - 2012
- [c1]Emanuele D'Osualdo, Jonathan Kochems, Luke Ong:
Soter: an automatic safety verifier for erlang. AGERE!@SPLASH 2012: 137-140
Informal and Other Publications
- 2022
- [i8]Dan Frumin, Emanuele D'Osualdo, Bas van den Heuvel, Jorge A. Pérez:
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency. CoRR abs/2209.05421 (2022) - [i7]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving Hypersafety Compositionally. CoRR abs/2209.07448 (2022) - [i6]Emanuele D'Osualdo, Azalea Raad, Viktor Vafeiadis:
The Path to Durable Linearizability. CoRR abs/2211.07631 (2022) - 2019
- [i5]Emanuele D'Osualdo, Azadeh Farzan, Philippa Gardner, Julian Sutherland:
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs. CoRR abs/1901.05750 (2019) - [i4]Emanuele D'Osualdo, Felix Stutz:
Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. CoRR abs/1911.05430 (2019) - 2016
- [i3]Emanuele D'Osualdo, C.-H. Luke Ong:
On Hierarchical Communication Topologies in the pi-calculus. CoRR abs/1601.01725 (2016) - 2015
- [i2]Emanuele D'Osualdo, Luke Ong:
A Type System for proving Depth Boundedness in the pi-calculus. CoRR abs/1502.00944 (2015) - 2013
- [i1]Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong:
Automatic Verification of Erlang-Style Concurrency. CoRR abs/1303.2201 (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 2023-09-27 22:54 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:
