1499 search results - page 211 / 300 » Chopping Concurrent Programs |
CAV
2008
Springer
14 years 8 days ago
2008
Springer
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...
ENTCS
2007
13 years 10 months ago
2007
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...
ACTA
2004
13 years 10 months ago
2004
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 ...
JUCS
2000
13 years 10 months ago
2000
: 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 ...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
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...