Sciweavers

74 search results - page 5 / 15
» Local Proofs for Linear-Time Properties of Concurrent Progra...
Sort
View
POPL
2009
ACM
14 years 9 months ago
A calculus of atomic actions
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...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
14 years 16 days ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
ICFP
2005
ACM
14 years 8 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
CC
2008
Springer
124views System Software» more  CC 2008»
13 years 10 months ago
Coqa: Concurrent Objects with Quantized Atomicity
This paper introduces a new language model, Coqa, for deeply embedding concurrent programming into objects. Every program written in our language has the desirable behaviors of ato...
Yu David Liu, Xiaoqi Lu, Scott F. Smith
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 3 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...