Sciweavers

73 search results - page 7 / 15
» Concurrency Annotations
Sort
View
IEEEPACT
2009
IEEE
13 years 5 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
14 years 2 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
PPOPP
2011
ACM
12 years 10 months ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
CONCURRENCY
2008
98views more  CONCURRENCY 2008»
13 years 7 months ago
An ontology-based approach to handling information quality in e-Science
context. In contrast to previous approaches that take a very abstract view of IQ properties, we allow scientists to define the quality characteristics that are of importance to the...
Alun D. Preece, Paolo Missier, Suzanne M. Embury, ...
COORDINATION
2009
Springer
14 years 8 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan