We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
: Since the era of vector and pipelined computing, the computational speed is limited by the memory access time. Faster caches and more cache levels are used to bridge the growing ...
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
Roberto Palmieri, Francesco Quaglia, Paolo Romano,...