Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...