Sciweavers

2300 search results - page 57 / 460
» Maximally Concurrent Programs
Sort
View
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
13 years 7 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
JFP
2000
91views more  JFP 2000»
13 years 9 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 10 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
IPPS
2010
IEEE
13 years 8 months ago
A GPU-inspired soft processor for high-throughput acceleration
There is building interest in using FPGAs as accelerators for high-performance computing, but existing systems for programming them are so far inadequate. In this paper we propose...
Jeffrey Kingyens, J. Gregory Steffan
IROS
2007
IEEE
112views Robotics» more  IROS 2007»
14 years 4 months ago
Orchestrating concurrency in robot swarms
— A functional approach to programming robot swarms brings with it well-defined properties that allow for automated concurrency and distributed execution. Further, the particula...
Anthony Cowley, Camillo J. Taylor