Fence Semantics

Fence Semantics is a synchronization construct in memory consistency models that enforces a total ordering constraint on memory operations by prohibiting reordering of accesses across the fence, thereby distinguishing it from other synchronization mechanisms through its explicit control over instruction execution order relative to memory visibility.

13

Publications

541

Citations

29

Authors

19

Institutions

Publications per year

2017–2026

2

Authors

29

  1. MV
    Martin Vechev

    ETH Zurich, Switzerland

    4 publications · 210 citations

    4

    h-index

  2. EY
    Eran Yahav

    Technion – Israel Institute of Technology, Israel

    4 publications · 210 citations

    4

    h-index

  3. MK
    Michael Kuperstein

    Wellesley College, United States

    2 publications · 117 citations

    2

    h-index

  4. JA
    Jade Alglave

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 79 citations

    2

    h-index

  5. VV
    Viktor Vafeiadis

    Max Planck Institute for Software Systems, Germany

    2 publications · 111 citations

    2

    h-index

1–5 of 29

Venues

  1. ACM SIGPLAN Notices

    3 publications · 102 citations

    3

    h-index

  2. Proceedings from Semantics and Linguistic Theory

    SALT · 1 publications · 15 citations

    1

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 39 citations

    1

    h-index

  4. Taxon

    1 publications · 11 citations

    1

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 11 citations

    1

    h-index

1–5