Reasoning about concurrent programs is challenging, especially if data shared among threads. Program correctness can be violated by the presence of races—whose prevention has been a topic concern both in research and practice. The Rust programming language prime example, putting slogan fearless concurrency practice not only employing an ownership-based type system for memory management, but als...

The fast growth of Radio Frequency IDentification (RFID) implies a deployment challenge, namely how to keep this technology scalable without renouncing security and privacy features. This paper focuses on combining tag privacy and scalability using the hash locks mechanism. Our contribution is twofold: (i) a cell-based architecture is proposed in which the readers co-operate in order to conduct...

Concurrent programming has become necessary to benefit from current multi-core processors. The main challenge is safely accessing shared resources from multiple parallel threads, which is typically done with locks. Simple locking mechanisms are easier to implement correctly, but often suffer from high lock contention, which means that threads frequently have to wait until another thread release...

Many current high level languages have been designed with support for con-currency in mind, providing constructs for the programmer to build explicit parallelism into a program. The EuLisp threads mechanism, in conjunction with locks, and a generic event waiting operation provides a set of primitive tools with which such concurrency abstractions can be constructed. The object system (TELOS) pro...

The programming language Mezzo is equipped with a rich type system that controls aliasing and access to mutable memory. We give a comprehensive tutorial overview of the language. Then, we present a modular formalization of Mezzo’s core type system, in the form of a concurrent λ-calculus, which we successively extend with references, locks, and adoption and abandon, a novel mechanism that marrie...

We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant — although it suffices to ill...

Domain hierarchy and closed loops (DHcL) (http://sitron.bccs.uib.no/dhcl/) is a web server that delineates energy hierarchy of protein domain structure and detects domains at different levels of this hierarchy. The server also identifies closed loops and van der Waals locks, which constitute a structural basis for the protein domain hierarchy. The DHcL can be a useful tool for an express analys...

Transactional updates to groups of keys are common to a wide class of distributed systems, spanning MapReduce-based workloads, distributed key-value stores and conventional distributed object databases. Such updates are typically implemented using nested transactions/ locks. The cost of such updates is critically dependent on the nesting depth, the contention on any one lock, and the coherence ...

In this paper, we present a concurrency control mechanism that deals with three important issues in object-oriented databases (OODBs): semantics of methods, nested method invocation and referentially shared object. In our scheme, locks are required for the execution of methods instead of atomic operations. By doing this, we reduce the locking overhead and deadlocks due to lock escalation. Espec...

We have realized a very small optical dipole trap that is designed to store and manipulate individual atoms. Due to the very small dipole-trap volume, a 'collisional blockade' mechanism locks the average number of trapped atoms at a value of 0.5 over a large range of loading rates. Here we describe methods to characterize the motion of a single trapped atom, and we also demonstrate the possibil...