Sciweavers

1499 search results - page 183 / 300
» Chopping Concurrent Programs
Sort
View
108
Voted
EUROSYS
2009
ACM
15 years 9 months ago
xCalls: safe I/O in memory transactions
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
Haris Volos, Andres Jaan Tack, Neelam Goyal, Micha...
123
Voted
KBSE
2005
IEEE
15 years 6 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...
GSEM
2004
Springer
15 years 6 months ago
The Grid-Occam Project
Occam is a parallel processing language designed by a team at INMOS in conjunction with the design of the transputer processor, and based on Sir T. Hoare's ideas of Communica...
Peter Tröger, Martin von Löwis, Andreas ...
117
Voted
DC
2010
15 years 24 days ago
Model checking transactional memories
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...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
112
Voted
PLDI
2009
ACM
15 years 7 months ago
Analyzing recursive programs using a fixed-point calculus
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 ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...