8 search results - page 1 / 2 » Local reasoning about storable locks |
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
APLAS
2007
ACM
13 years 9 months ago
2007
ACM
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. T...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
FOSSACS
2010
Springer
14 years 2 days ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
FCSC
2010
13 years 2 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...