1550 search results - page 194 / 310 » Erlang for Concurrent Programming |
133
click to vote
DC
2010
15 years 1 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
128
click to vote
PLDI
2009
ACM
15 years 8 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
150
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
113
click to vote
FASE
2006
Springer
15 years 5 months ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...
110
click to vote
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...