![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Oleg Travkin
Person information
- affiliation: University of Paderborn, Germany
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
- [b1]Oleg Travkin:
Verifying concurrent programs under weak memory models. University of Paderborn, Germany, 2017
Journal Articles
- 2018
- [j3]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) - 2014
- [j2]Bogdan Tofan, Oleg Travkin, Gerhard Schellhorn, Heike Wehrheim:
Two approaches for proving linearizability of multiset. Sci. Comput. Program. 96: 297-314 (2014) - 2012
- [j1]Oleg Travkin, Heike Wehrheim, Gerhard Schellhorn:
Proving Linearizability of Multiset with Local Proof Obligations. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 53 (2012)
Conference and Workshop Papers
- 2018
- [c10]Gerhard Schellhorn, Monika Wedel, Oleg Travkin, Jürgen König, Heike Wehrheim:
FastLane Is Opaque - a Case Study in Mechanized Proofs of Opacity. SEFM 2018: 105-120 - 2016
- [c9]Oleg Travkin, Heike Wehrheim:
Verification of Concurrent Programs on Weak Memory Models. ICTAC 2016: 3-24 - [c8]Gerhard Schellhorn, Oleg Travkin, Heike Wehrheim:
Towards a Thread-Local Proof Technique for Starvation Freedom. IFM 2016: 193-209 - 2015
- [c7]John Derrick
, Brijesh Dongol
, Gerhard Schellhorn, Oleg Travkin, Heike Wehrheim:
Verifying Opacity of a Transactional Mutex Lock. FM 2015: 161-177 - [c6]Heike Wehrheim, Oleg Travkin:
TSO to SC via Symbolic Execution. Haifa Verification Conference 2015: 104-119 - 2014
- [c5]John Derrick
, Brijesh Dongol
, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, Heike Wehrheim:
Quiescent Consistency: Defining and Verifying Relaxed Linearizability. FM 2014: 200-214 - [c4]Oleg Travkin, Heike Wehrheim:
Handling TSO in Mechanized Linearizability Proofs. Haifa Verification Conference 2014: 132-147 - 2013
- [c3]Oleg Travkin, Annika Mütze, Heike Wehrheim:
SPIN as a Linearizability Checker under Weak Memory Models. Haifa Verification Conference 2013: 311-326 - [c2]Brijesh Dongol
, Oleg Travkin, John Derrick, Heike Wehrheim:
A High-Level Semantics for Program Execution under Total Store Order Memory. ICTAC 2013: 177-194 - 2011
- [c1]Oleg Travkin, Markus von Detten, Steffen Becker:
Towards the Combination of Clustering-based and Pattern-based Reverse Engineering Approaches. Software Engineering (Workshops) 2011: 23-28
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint