final Thread[] readerThreads = new Thread[readerThreadCount];
        final java.util.List<Boolean>[] observations = new java.util.List[readerThreadCount];
        final CountDownLatch startLatch = new CountDownLatch(1);

        // Initialize observation lists
        for (int i = 0; i < readerThreadCount; i++) {
            observations[i] = new java.util.ArrayList<>();
        }

              // Only search a subset of the static header table. Most entries have an empty value, so
              // it's unnecessary to waste cycles looking at them. This check is built on the
              // observation that the header entries we care about are in adjacent pairs, and we
              // always know the first index of the pair.
              if (STATIC_HEADER_TABLE[headerNameIndex - 1].value == value) {

and <i>w'</i> happens before <i>r</i>.
That is, each read must observe a value written by a preceding or concurrent write.
</p>

<p>
Additionally, observation of acausal and “out of thin air” writes is disallowed.
</p>

<p>
Reads of memory locations larger than a single machine word
are encouraged but not required to meet the same semantics