Sciweavers

1491 search results - page 61 / 299
» Resource-Passing Concurrent Programming
Sort
View
PLDI
2012
ACM
12 years 12 days ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
CONCURRENCY
2000
99views more  CONCURRENCY 2000»
13 years 9 months ago
The Java memory model is fatally flawed
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
William Pugh
CONCURRENCY
2002
107views more  CONCURRENCY 2002»
13 years 9 months ago
A callgraph-based search strategy for automated performance diagnosis
Abstract. We introduce a new technique for automated performance diagnosis, using the program's callgraph. We discuss our implementation of this diagnosis technique in the Par...
Harold W. Cain, Barton P. Miller, Brian J. N. Wyli...
SIGSOFT
2003
ACM
14 years 10 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke
EUROSYS
2011
ACM
13 years 1 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues