Sciweavers

2300 search results - page 263 / 460
» Maximally Concurrent Programs
Sort
View
PLDI
2011
ACM
14 years 9 months ago
Automated atomicity-violation fixing
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
Guoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben...
PPOPP
2012
ACM
14 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
PLDI
2012
ACM
13 years 9 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
PPOPP
2009
ACM
16 years 7 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...
TLDI
2010
ACM
210views Formal Methods» more  TLDI 2010»
16 years 3 months ago
Effects for cooperable and serializable threads
Reasoning about the correctness of multithreaded programs is complicated by the potential for unexpected interference between threads. Previous work on controlling thread interfer...
Jaeheon Yi, Cormac Flanagan