English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We investigate the problem of runtime analysis of C11 programs underMulti-Copy-Atomic semantics (MCA). Under MCA, one can analyze program outcomessolely through interleaving and reordering of thread events. As a result,obtaining intuitive explanations of program outcomes becomes straightforward.Newer versions of ARM (ARMv8 and later), Alpha, and Intel's x-86 support MCA.Our tests reveal that state-of-the-art dynamic verification techniques thatanalyze program executions under the C11 memory model generate safety propertyviolations that can be interpreted as false alarms under MCA semantics. Sortingthe true from false violations puts an undesirable burden on the user. In thiswork, we provide a dynamic verification technique (MoCA) to analyze C11 programexecutions which are permitted under the MCA model. We design a happens-beforerelation and introduce coherence rules to capture precisely those C11 programexecutions which are allowed under the MCA model. MoCA's exploration of thestate-space is based on the state-of-the-art dynamic verification algorithm,source-DPOR. Our experiments validate that MoCA captures all coherent C11program executions, and is precise for the MCA model.

Dynamic Verification of C/C++11 Concurrency over Multi Copy Atomics