Learn More
Over the last decade, great progress has been made in developing practical transactional memory (TM) implementations, but relatively little attention has been paid to precisely specifying what it means for them to be correct, or formally proving that they are. In this paper, we present TMS1 (Transactional Memory Specification 1), a precise specification of(More)
The ability of sighted, blindfolded individuals to navigate while walking was assessed in two types of tasks, one requiring knowledge of a route that previously had been navigated and another requiring more complex spatial inference or computation. A computerized measurement system monitored spatial position. The route tasks included maintenance of a(More)
We describe a semi-automated verification of a slightly optimised version of Michael and Scott's lock-free FIFO queue implementation. We verify the algorithm with a simulation proof consisting of two stages: a forward simulation from an automaton modelling the algorithm to an intermediate automaton, and a backward simulation from the intermediate automaton(More)
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only single-location synchronisation primitives such as compare-and-swap (CAS) and load-linked/store-conditional (LL/SC). Recently researchers have investigated the utility of(More)
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems and applications. As software catches up to hardware, "64-bit-clean" lock-free data structures, which cannot use such techniques, are needed.We present several 64-bit-clean lock-free(More)
Our two experiments investigated associations between cognitive representations of objects and hand-shape categories. Hand configurations were partitioned according to prehensility and the size of the contacting surface, resulting in the classes: pinch, poke, palm, and clench. Experiment 1 elicited object names in response to configuration-name cues,(More)
This thesis presents techniques for the machine-assisted verification of an important class of concurrent algorithms, called non-blocking algorithms. The notion of linearizability is used as a correctness condition for concurrent implementations of sequential datatypes and the use of forward simulation relations as a proof method for showing linearizability(More)
The membrane metalloenzyme endopeptidase-24.11 has been localized by immunocytochemistry in the porcine hippocampus in the stratum oriens and stratum radiatum. Endopeptidase-24.11 was found to be approximately 10-fold more abundant in a striatal than a hippocampal membrane preparation. Both somatostatin-28 and somatostatin-14 were metabolized by(More)