Остановите войну!
for scientists:
default search action
Gerhard Schellhorn
- > Home > Persons > Gerhard Schellhorn
Publications
- 2024
- [c72]Stefan Bodenmüller, John Derrick, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
A Fully Verified Persistency Library. VMCAI (2) 2024: 26-47 - 2022
- [j34]Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Modularising Verification Of Durable Opacity. Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [j33]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) - [c65]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 - [i3]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
On Strong Observational Refinement and Forward Simulation. CoRR abs/2107.14509 (2021) - 2020
- [c63]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 - [i2]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) - [i1]Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Modularising Verification Of Durable Opacity. CoRR abs/2011.15013 (2020) - 2019
- [c61]John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Verifying Correctness of Persistent Concurrent Data Structures. FM 2019: 179-195 - 2018
- [j32]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) - 2016
- [c56]Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Proving Opacity of a Pessimistic STM. OPODIS 2016: 35:1-35:17 - 2015
- [c55]John Derrick, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, Heike Wehrheim:
Verifying Opacity of a Transactional Mutex Lock. FM 2015: 161-177 - 2014
- [j25]Gerhard Schellhorn, John Derrick, Heike Wehrheim:
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. ACM Trans. Comput. Log. 15(4): 31:1-31:37 (2014) - [c51]John Derrick, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, Heike Wehrheim:
Quiescent Consistency: Defining and Verifying Relaxed Linearizability. FM 2014: 200-214 - 2012
- [c47]Gerhard Schellhorn, Heike Wehrheim, John Derrick:
How to Prove Algorithms Linearisable. CAV 2012: 243-259 - 2011
- [j20]Eerke A. Boiten, John Derrick, Gerhard Schellhorn:
Selected papers of the Refinement Workshop Turku (2008). Sci. Comput. Program. 76(9): 737-738 (2011) - [j18]John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Mechanically verified proof obligations for linearizability. ACM Trans. Program. Lang. Syst. 33(1): 4:1-4:43 (2011) - [c45]John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Verifying Linearisability with Potential Linearisation Points. FM 2011: 323-337 - 2009
- [j14]Eerke A. Boiten, John Derrick, Gerhard Schellhorn:
Relational concurrent refinement part II: Internal operations and outputs. Formal Aspects Comput. 21(1-2): 65-102 (2009) - 2008
- [c30]John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack. FMOODS 2008: 78-95 - [c27]Eerke A. Boiten, John Derrick, Gerhard Schellhorn:
Preface. Refine@FM 2008: 1 - [e1]Eerke A. Boiten, John Derrick, Gerhard Schellhorn:
Proceedings of the 13th BAC-FACS Refinement Workshop, Refine@FM 2008, Turku, Finland, May 27, 2008. Electronic Notes in Theoretical Computer Science 214, Elsevier 2008 [contents] - 2007
- [c24]John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Proving Linearizability Via Non-atomic Refinement. IFM 2007: 195-214
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-02-07 04:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint