Sciweavers

45 search results - page 9 / 9
» Reasoning about Optimistic Concurrency Using a Program Logic...
Sort
View
ISSTA
2012
ACM
11 years 7 months ago
Cooperative types for controlling thread interference in Java
Multithreaded programs are notoriously prone to unintended interference between concurrent threads. To address this problem, we argue that yield annotations in the source code sho...
Jaeheon Yi, Tim Disney, Stephen N. Freund, Cormac ...
OOPSLA
2010
Springer
13 years 3 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
POPL
2009
ACM
14 years 6 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
SIGSOFT
2007
ACM
14 years 6 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
POPL
2009
ACM
14 years 6 months ago
The semantics of progress in lock-based transactional memory
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
Rachid Guerraoui, Michal Kapalka