4 search results - page 1 / 1 » Simplifying Linearizability Proofs with Reduction and Abstra... |
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
HASKELL
2009
ACM
13 years 11 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...