default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeike Wehrheim
- > Home > Persons > Heike Wehrheim
Publications
- 2024
[c155]Lara Bargmann, Brijesh Dongol
, Heike Wehrheim:
Unifying Weak Memory Verification Using Potentials. FM (1) 2024: 519-537- [c152]Stefan Bodenmüller, John Derrick, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
A Fully Verified Persistency Library. VMCAI (2) 2024: 26-47 - 2023
- [c151]Ori Lahav, Brijesh Dongol, Heike Wehrheim:
Rely-Guarantee Reasoning for Causally Consistent Shared Memory. CAV (1) 2023: 206-229 - [c149]Heike Wehrheim, Lara Bargmann, Brijesh Dongol:
Reasoning About Promises in Weak Memory Models with Event Structures. FM 2023: 282-300 - [i25]Ori Lahav, Brijesh Dongol, Heike Wehrheim:
Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version). CoRR abs/2305.08486 (2023) - 2022
- [j39]Sadegh Dalvandi, Brijesh Dongol, Simon Doherty, Heike Wehrheim:
Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL. J. Autom. Reason. 66(1): 141-171 (2022) - [j38]Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Modularising Verification Of Durable Opacity. Log. Methods Comput. Sci. 18(3) (2022) - [j37]Simon Doherty, Sadegh Dalvandi, Brijesh Dongol, Heike Wehrheim:
Unifying Operational Weak Memory Verification: An Axiomatic Approach. ACM Trans. Comput. Log. 23(4): 27:1-27:39 (2022) - [c138]Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. CONCUR 2022: 31:1-31:23 - [i20]Heike Wehrheim, Lara Bargmann, Brijesh Dongol:
Reasoning about Promises in Weak Memory Models with Event Structures (Extended Version). CoRR abs/2211.16330 (2022) - 2021
- [j35]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Verifying correctness of persistent concurrent data structures: a sound and complete method. Formal Aspects Comput. 33(4-5): 547-573 (2021) - [c124]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Brief Announcement: On Strong Observational Refinement and Forward Simulation. DISC 2021: 55:1-55:4 - [i16]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
On Strong Observational Refinement and Forward Simulation. CoRR abs/2107.14509 (2021) - 2020
- [j30]Sadegh Dalvandi, Simon Doherty, Brijesh Dongol, Heike Wehrheim:
Owicki-Gries Reasoning for C11 RAR (Artifact). Dagstuhl Artifacts Ser. 6(2): 15:1-15:2 (2020) - [c123]Sadegh Dalvandi, Simon Doherty, Brijesh Dongol, Heike Wehrheim:
Owicki-Gries Reasoning for C11 RAR. ECOOP 2020: 11:1-11:26 - [c122]Eleni Bila, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. FORTE 2020: 39-58 - [i14]Eleni Bila, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. CoRR abs/2004.08200 (2020) - [i12]Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Modularising Verification Of Durable Opacity. CoRR abs/2011.15013 (2020) - 2019
- [c115]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Verifying Correctness of Persistent Concurrent Data Structures. FM 2019: 179-195 - [c111]Simon Doherty, Brijesh Dongol, Heike Wehrheim, John Derrick:
Verifying C11 programs operationally. PPoPP 2019: 355-365 - 2018
- [j26]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, Heike Wehrheim:
Mechanized proofs of opacity: a comparison of two techniques. Formal Aspects Comput. 30(5): 597-625 (2018) - [c103]Simon Doherty, Brijesh Dongol, Heike Wehrheim, John Derrick:
Making Linearizability Compositional for Partially Ordered Executions. IFM 2018: 110-129 - [c99]Simon Doherty, Brijesh Dongol, Heike Wehrheim, John Derrick:
Brief Announcement: Generalising Concurrent Correctness to Weak Memory. DISC 2018: 45:1-45:3 - [i10]Simon Doherty, John Derrick, Brijesh Dongol, Heike Wehrheim:
Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR abs/1802.01866 (2018) - [i7]Simon Doherty, Brijesh Dongol, Heike Wehrheim, John Derrick:
Verifying C11 Programs Operationally. CoRR abs/1811.09143 (2018) - 2016
- [c88]Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Proving Opacity of a Pessimistic STM. OPODIS 2016: 35:1-35:17 - 2015
- [c83]John Derrick, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, Heike Wehrheim:
Verifying Opacity of a Transactional Mutex Lock. FM 2015: 161-177 - 2014
- [c78]John Derrick, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, Heike Wehrheim:
Quiescent Consistency: Defining and Verifying Relaxed Linearizability. FM 2014: 200-214 - 2013
- [c67]Brijesh Dongol, Oleg Travkin, John Derrick, Heike Wehrheim:
A High-Level Semantics for Program Execution under Total Store Order Memory. ICTAC 2013: 177-194
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-09-22 00:37 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:
