150 search results - page 16 / 30 » A Calculus for Relaxed Memory |
121
click to vote
HASKELL
2009
ACM
15 years 5 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
TABLEAUX
2009
Springer
15 years 5 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
104
click to vote
PLDI
2010
ACM
15 years 3 months ago
2010
ACM
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
FPL
2007
Springer
15 years 5 months ago
2007
Springer
The complexity of today’s embedded applications requires modern high-performance embedded System-on-Chip (SoC) platforms to be multiprocessor architectures. Advances in FPGA tec...
109
click to vote
ASPLOS
1996
ACM
15 years 2 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...