Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Batty
Person information
- affiliation: University of Kent, School of Computing
- affiliation (PhD 2015): University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Sarah Harris, Simon Cooksey, Michael Vollmer, Mark Batty:
Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Artifact). Dagstuhl Artifacts Ser. 9(2): 25:1-25:2 (2023)- [j2]Daniel Wright
, Sadegh Dalvandi, Mark Batty, Brijesh Dongol:
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies. Formal Aspects Comput. 35(2): 10:1-10:27 (2023) - [c20]Sarah Harris, Simon Cooksey, Michael Vollmer, Mark Batty:
Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Experience Paper). ECOOP 2023: 39:1-39:27 - [c19]Akshay Gopalakrishnan, Clark Verbrugge, Mark Batty:
Memory Consistency Models for Program Transformations: An Intellectual Abstract. ISMM 2023: 30-42 - [c18]Mikhail Semenyuk, Mark Batty, Brijesh Dongol:
Verifying Read-Copy Update Under RC11. SEFM 2023: 301-319 - 2022
- [j1]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) - [c17]Sam Dawson, Mark Batty:
Chronos vs. Chaos: Timing Weak Memory Executions in the Linux Kernel. IWSPA@CODASPY 2022: 68-77 - 2021
- [c16]Daniel Wright, Mark Batty, Brijesh Dongol:
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies. FM 2021: 237-254 - [i5]Daniel Wright, Mark Batty, Brijesh Dongol:
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies (Extended Version). CoRR abs/2108.01418 (2021) - 2020
- [c15]Marco Paviotti, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, Mark Batty:
Modular Relaxed Dependencies in Weak Memory Concurrency. ESOP 2020: 599-625
2010 – 2019
- 2019
- [c14]Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, Mikolás Janota:
PrideMM: Second Order Model Checking for Memory Consistency Models. FM Workshops (2) 2019: 507-525 - [i4]Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, Mikolás Janota:
PrideMM: A Solver for Relaxed Memory Models. CoRR abs/1901.00428 (2019) - 2018
- [c13]Mike Dodds, Mark Batty, Alexey Gotsman:
Compositional Verification of Compiler Optimisations on Relaxed Memory. ESOP 2018: 1027-1055 - [i3]Mike Dodds, Mark Batty, Alexey Gotsman:
Compositional Verification of Compiler Optimisations on Relaxed Memory. CoRR abs/1802.05918 (2018) - 2017
- [c12]John Wickerson, Mark Batty, Tyler Sorensen, George A. Constantinides:
Automatically comparing memory consistency models. POPL 2017: 190-204 - [c11]Shaked Flur, Susmit Sarkar, Christopher Pulte, Kyndylan Nienhuis, Luc Maranget, Kathryn E. Gray, Ali Sezgin, Mark Batty, Peter Sewell:
Mixed-size concurrency: ARM, POWER, C/C++11, and SC. POPL 2017: 429-442 - 2016
- [c10]Tyler Sorensen, Alastair F. Donaldson, Mark Batty, Ganesh Gopalakrishnan, Zvonimir Rakamaric:
Portable inter-workgroup barrier synchronisation for GPUs. OOPSLA 2016: 39-58 - [c9]Mark Batty, Alastair F. Donaldson, John Wickerson:
Overhauling SC atomics in C11 and OpenCL. POPL 2016: 634-648 - 2015
- [b1]Mark John Batty:
The C11 and C++11 concurrency model. University of Cambridge, UK, 2015 - [c8]Jade Alglave, Mark Batty, Alastair F. Donaldson, Ganesh Gopalakrishnan, Jeroen Ketema, Daniel Poetzl, Tyler Sorensen, John Wickerson:
GPU Concurrency: Weak Behaviours and Programming Assumptions. ASPLOS 2015: 577-591 - [c7]Mark Batty, Kayvan Memarian, Kyndylan Nienhuis, Jean Pichon-Pharabod, Peter Sewell:
The Problem of Programming Language Concurrency Semantics. ESOP 2015: 283-307 - [c6]John Wickerson, Mark Batty, Bradford M. Beckmann, Alastair F. Donaldson:
Remote-scope promotion: clarified, rectified, and verified. OOPSLA 2015: 731-747 - [i2]John Wickerson, Mark Batty:
Taming the complexities of the C11 and OpenCL memory models. CoRR abs/1503.07073 (2015) - 2013
- [c5]Mark Batty, Mike Dodds, Alexey Gotsman:
Library abstraction for C/C++ concurrency. POPL 2013: 235-248 - [i1]Mike Dodds, Mark Batty, Alexey Gotsman:
C/C++ Causal Cycles Confound Compositionality. Tiny Trans. Comput. Sci. 2 (2013) - 2012
- [c4]Susmit Sarkar, Kayvan Memarian, Scott Owens, Mark Batty, Peter Sewell, Luc Maranget, Jade Alglave, Derek Williams:
Synchronising C/C++ and POWER. PLDI 2012: 311-322 - [c3]Mark Batty, Kayvan Memarian, Scott Owens, Susmit Sarkar, Peter Sewell:
Clarifying and compiling C/C++ concurrency: from C++11 to POWER. POPL 2012: 509-520 - 2011
- [c2]Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber:
Mathematizing C++ concurrency. POPL 2011: 55-66 - [c1]Jasmin Christian Blanchette, Tjark Weber, Mark Batty, Scott Owens, Susmit Sarkar:
Nitpicking C++ concurrency. PPDP 2011: 113-124
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-04-25 05:57 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:
