8 search results - page 2 / 2 » Local reasoning about storable locks |
CAV
2008
Springer
13 years 7 months 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...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....