Sciweavers

141 search results - page 5 / 29
» Automatically Proving Concurrent Programs Correct
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík
POPL
2011
ACM
12 years 10 months ago
Mathematizing C++ concurrency
Shared-memory concurrency in C and C++ is pervasive in systems programming, but has long been poorly defined. This motivated an ongoing shared effort by the standards committees ...
Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewe...
HOTOS
2007
IEEE
13 years 11 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell
PLDI
2006
ACM
14 years 1 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 9 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps