default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Podkopaev
Person information
- affiliation: JetBrains Research, Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Ori Lahav, Azalea Raad, Joseph Tassarotti, Viktor Vafeiadis, Anton Podkopaev:
Formal Methods for Correct Persistent Programming (Dagstuhl Seminar 23412). Dagstuhl Reports 13(10): 50-64 (2023)- 2022
- [j5]Alan Jeffrey
, James Riely, Mark Batty, Simon Cooksey, Ilya Kaysin, Anton Podkopaev:
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - 2021
- [j4]Ori Lahav, Egor Namakonov, Jonas Oberhauser, Anton Podkopaev, Viktor Vafeiadis:
Making weak memory models fair. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - [j3]Evgenii Moiseenko, Anton Podkopaev, Dmitrij V. Koznov:
A Survey of Programming Language Memory Models. Program. Comput. Softw. 47(6): 439-456 (2021) - 2020
- [j2]Evgenii Moiseenko, Anton Podkopaev, Ori Lahav, Orestis Melkonian, Viktor Vafeiadis:
Reconciling Event Structures with Modern Multiprocessors (Artifact). Dagstuhl Artifacts Ser. 6(2): 04:1-04:3 (2020) - [c5]Evgenii Moiseenko, Anton Podkopaev, Ori Lahav, Orestis Melkonian, Viktor Vafeiadis:
Reconciling Event Structures with Modern Multiprocessors. ECOOP 2020: 5:1-5:26 - [c4]Conrad Watt, Christopher Pulte, Anton Podkopaev, Guillaume Barbier, Stephen Dolan, Shaked Flur, Jean Pichon-Pharabod, Shu-yu Guo:
Repairing and mechanising the JavaScript relaxed memory model. PLDI 2020: 346-361 - [c3]Sung-Hwan Lee, Minki Cho, Anton Podkopaev, Soham Chakraborty, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis:
Promising 2.0: global optimizations in relaxed memory concurrency. PLDI 2020: 362-376 - [i5]Conrad Watt, Christopher Pulte, Anton Podkopaev, Guillaume Barbier, Stephen Dolan, Shaked Flur, Jean Pichon-Pharabod, Shu-yu Guo:
Repairing and Mechanising the JavaScript Relaxed Memory Model. CoRR abs/2005.10554 (2020) - [i4]Ori Lahav, Egor Namakonov, Jonas Oberhauser, Anton Podkopaev, Viktor Vafeiadis:
Making Weak Memory Models Fair. CoRR abs/2012.01067 (2020)
2010 – 2019
- 2019
- [j1]Anton Podkopaev, Ori Lahav, Viktor Vafeiadis:
Bridging the gap between programming languages and hardware weak memory models. Proc. ACM Program. Lang. 3(POPL): 69:1-69:31 (2019) - [i3]Evgenii Moiseenko, Anton Podkopaev, Ori Lahav, Orestis Melkonian, Viktor Vafeiadis:
Reconciling Event Structures with Modern Multiprocessors. CoRR abs/1911.06567 (2019) - 2018
- [i2]Anton Podkopaev, Ori Lahav, Viktor Vafeiadis:
Bridging the Gap Between Programming Languages and Hardware Weak Memory Models. CoRR abs/1807.07892 (2018) - 2017
- [c2]Anton Podkopaev, Ori Lahav, Viktor Vafeiadis:
Promising Compilation to ARMv8 POP. ECOOP 2017: 22:1-22:28 - 2016
- [i1]Anton Podkopaev, Ilya Sergey, Aleksandar Nanevski:
Operational Aspects of C/C++ Concurrency. CoRR abs/1606.01400 (2016) - 2014
- [c1]Anton Podkopaev, Dmitri Boulytchev:
Polynomial-Time Optimal Pretty-Printing Combinators with Choice. Ershov Memorial Conference 2014: 257-265
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-10-07 21:19 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:
