{
  "slug": "strict-linearizability",
  "term": "Strict linearizability",
  "aliases": [
    "Strictly linearizable"
  ],
  "definition": "Strict linearizability adds a crash deadline to linearizability: an interrupted operation takes effect before its caller crashes or has no effect.",
  "note": "In the original model, a crashed process stops permanently and shared objects do not fail. Successful calls still respect their invocation-response intervals; the extra boundary concerns calls interrupted by a crash. [strict03]\n\nA strict completion can insert a pending call's response before the crash or discard that call, while preserving the resulting real-time order. This rules out a previously ineffective write first becoming effective after its caller's crash. [recover15]\n\nDurable linearizability uses full-system crashes and new abstract threads in later eras. It preserves completed calls but can allow a pending call to take effect in a later era. The crash deadline is therefore an additional restriction, not another name for durability. [disc16]\n\nThe condition constrains the abstract operation history, not every recovery instruction. It does not supply the caller with a lost return value or a method for deciding which interrupted call took effect. [strict03] [recover15]\n\nA history-level deadline is not a timestamp for implementation writes. The persistent-set literature distinguishes apparent limited effect from strict limited effect (SLE), which additionally constrains a set operation's key write relative to a crash. SLE is a separate set-specific condition, not a synonym. [fence23]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "A safety property does not establish wait-freedom or a time limit for recovery.",
      "citationIds": [
        "strict03",
        "disc16"
      ]
    }
  ],
  "related": [
    "linearizability",
    "durable-linearizability",
    "detectability",
    "crash-consistency"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "citations": [
    {
      "id": "strict03",
      "title": "Aguilera and Frolund. Strict Linearizability and the Power of Aborting. HPL-2003-241 (2003), sections 1-3.6.",
      "url": "https://shiftleft.com/mirrors/www.hpl.hp.com/techreports/2003/HPL-2003-241.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "recover15",
      "title": "Berryhill, Golab and Tripunitara. Robust Shared Objects for Non-Volatile Main Memory. OPODIS 2015, section 4, Definition 2.",
      "url": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol046-opodis2015/LIPIcs.OPODIS.2015.20/LIPIcs.OPODIS.2015.20.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "disc16",
      "title": "Izraelevitz, Mendes and Scott. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. DISC 2016, sections 1-2 and 3.3.",
      "url": "https://www.cs.rochester.edu/u/scott/papers/2016_DISC_persistence.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "hesela-pmem",
      "title": "Hesela. Persistent memory: DAX is not a durable commit.",
      "url": "https://hesela.com/analyses/pmem-persistence-domains-dax/",
      "accessed": "2026-11-20"
    },
    {
      "id": "fence23",
      "title": "Coccimiglio, Brown and Ravi. The Fence Complexity of Persistent Sets (2023), expanded manuscript, section 5.",
      "url": "https://mc.uwaterloo.ca/pubs/fence_complexity/fullpaper.pdf",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "Primary-source synthesis of the crash boundary, not strict serializability or a storage-device persistence-ordering model.",
    "The 2003 report is the original primary text hosted on a mirror; sections 2 and 3.6 specify its failure model and formal definition.",
    "The linked article's two-read example is a finite constructed history, not a cluster run, hardware test or implementation correctness proof."
  ]
}
