Interpreting others' actions relies on an understanding of their current mental state. Emerging research has begun to identify a number of factors that give rise to individual differences in this ability. We report an event-related brain potential study where participants (N = 28) read contexts that described a character having a true belief (TB) or false belief (FB) about an object's location. A second sentence described where that character would look for the object. Critically, this sentence included a sentence-final noun that was either consistent or inconsistent with the character's belief. Participants also completed the Empathy Quotient questionnaire. Analysis of the N400 revealed that when the character held a TB about the object's location, the N400 waveform was more negative-going for belief inconsistent vs belief consistent critical words. However, when the character held an FB about the object's location the opposite pattern was found. Intriguingly, correlations between the N400 inconsistency effect and individuals' empathy scores showed a significant correlation for FB but not TB. This suggests that people who are high in empathy can successfully interpret events according to the character's FB, while low empathizers bias their interpretation of events to their own egocentric view.

We present a denotational semantics for weak memory concurrency that avoids thin-air reads, provides data-race free programs with sequentially consistent semantics (DRF-SC), and supports a compositional refinement relation for validating optimisations. Our semantics identifies false program dependencies that might be removed by compiler optimisation, and leaves in place just the dependencies necessary to rule out thin-air reads. We show that our dependency calculation can be used to rule out thin-air reads in any axiomatic concurrency model, in particular C++. We present a tool that automatically evaluates litmus tests, show that we can augment C++ to fix the thin-air problem, and we prove that our augmentation is compatible with the previously used compilation mappings over key processor architectures. We argue that our dependency calculation offers a practical route to fixing the longstanding problem of thin-air reads in the C++ specification.

The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics for increasingly large fragments of C11. However, these semantics and logics have been developed in a restricted setting to avoid the thin-air-read problem. In this paper, we propose an operational semantics that leverages an intra-thread partial order (called semantic dependencies ) induced by a recently developed denotational event-structure-based semantics. We prove that our operational semantics is sound and complete with respect to the denotational semantics. We present an associated logic that generalises a recent Owicki-Gries framework for RC11 RAR (repaired C11) with relaxed and release-acquire accesses. We describe the mechanisation of the logic in the Isabelle/HOL theorem prover, which we use to prove correctness of a number of examples.

No abstract