Concurrency libraries can facilitate the development of multi-threaded programs by
providing concurrent implementations of familiar data types such as queues or sets. There …

Modern architectures rely on memory fences to prevent undesired weakenings of memory
consistency. As the fences' semantics may be subtle, the automation of their placement is …

Implementing highly efficient and correct synchronization primitives on modern Weak
Memory Model (WMM) architectures, such as ARM and RISC-V, is very difficult even for …

Computer architecture forms the bridge between application needs and the capabilities of
the underlying technologies. As application demands change and technologies cross …

The upcoming C and C++ revised standards add concurrency to the languages, for the first
time, in the form of a subtle* relaxed memory model*(the* C++ 11 model*). This aims to …

Program verification for relaxed memory models is hard. The high degree of nondeterminism
in such models challenges standard verification techniques. This paper proposes a new …

We addresses the problem of automatic verification and fence inference in concurrent
programs running under relaxed memory models. Modern architectures implement relaxed …

Modern architectures implement relaxed memory models which may reorder memory
operations or execute them non-atomically. Special instructions called memory fences are …

We present an approach for automatic verification and fence inference in concurrent
programs running under relaxed memory models. Verification under relaxed memory …

We give a sound and complete fence insertion procedure for concurrent finite-state
programs running under the classical TSO memory model. This model allows “write to read” …