Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-
performance and reliable concurrent systems code, for concurrent data structures, operating …
performance and reliable concurrent systems code, for concurrent data structures, operating …
[PDF][PDF] Finding and Reproducing Heisenbugs in Concurrent Programs.
Concurrency is pervasive in large systems. Unexpected interference among threads often
results in “Heisenbugs” that are extremely difficult to reproduce and eliminate. We have …
results in “Heisenbugs” that are extremely difficult to reproduce and eliminate. We have …
A better x86 memory model: x86-TSO
Real multiprocessors do not provide the sequentially consistent memory that is assumed by
most work on semantics and verification. Instead, they have relaxed memory models …
most work on semantics and verification. Instead, they have relaxed memory models …
Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8
ARM has a relaxed memory model, previously specified in informal prose for ARMv7 and
ARMv8. Over time, and partly due to work building formal semantics for ARM concurrency, it …
ARMv8. Over time, and partly due to work building formal semantics for ARM concurrency, it …
Stateless model checking for TSO and PSO
We present a technique for efficient stateless model checking of programs that execute
under the relaxed memory models TSO and PSO. The basis for our technique is a novel …
under the relaxed memory models TSO and PSO. The basis for our technique is a novel …
On the verification problem for weak memory models
We address the verification problem of finite-state concurrent programs running under weak
memory models. These models capture the reordering of program (read and write) …
memory models. These models capture the reordering of program (read and write) …
The semantics of x86-CC multiprocessor machine code
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially
consistent memory that is assumed by most work on semantics and verification. Instead, they …
consistent memory that is assumed by most work on semantics and verification. Instead, they …
Fences in weak memory models
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen
permitted local reorderings of reads and writes, and the visibility of inter-and intra-processor …
permitted local reorderings of reads and writes, and the visibility of inter-and intra-processor …
Optimal stateless model checking under the release-acquire semantics
We present a framework for the efficient application of stateless model checking (SMC) to
concurrent programs running under the Release-Acquire (RA) fragment of the C/C++ 11 …
concurrent programs running under the Release-Acquire (RA) fragment of the C/C++ 11 …
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires thread-safe components that
behave correctly when called concurrently by multiple client threads. This paper focuses on …
behave correctly when called concurrently by multiple client threads. This paper focuses on …