22 search results - page 4 / 5 » Operational Reasoning for Concurrent Caml Programs and Weak ... |
POPL
2008
ACM
14 years 6 months ago
2008
ACM
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
HASKELL
2009
ACM
14 years 28 days 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...
SP
2009
IEEE
14 years 1 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
TLDI
2009
ACM
14 years 3 months ago
2009
ACM
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
TPHOL
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...