Sciweavers

1550 search results - page 136 / 310
» Erlang for Concurrent Programming
Sort
View
OOPSLA
2005
Springer
15 years 7 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
PLDI
2011
ACM
14 years 4 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...
129
Voted
PPOPP
2012
ACM
13 years 9 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 4 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
CAISE
1995
Springer
15 years 5 months ago
Hypertext Version Management in an Actor-based Framework
In this work we discuss a number of issues for the design of hypertext systems in an actor-based model of computation. We examine how the "traditional" basic concepts whi...
Antonina Dattolo, Vincenzo Loia