Sciweavers

1499 search results - page 115 / 300
» Chopping Concurrent Programs
Sort
View
102
Voted
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
15 years 11 days ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
116
Voted
PLDI
2012
ACM
13 years 3 months 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...
204
Voted
POPL
2009
ACM
16 years 1 months ago
A calculus of atomic actions
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
83
Voted
EUROPAR
2003
Springer
15 years 6 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
CONCUR
2007
Springer
15 years 6 months ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson